TY  - JOUR
ID  - Ivančo2017
LB  - Ivančo2017
AU  - Ivančo, Jaroslav
TI  - On 3-total edge product cordial connected graphs
ST  - On 3-total edge product cordial connected graphs
JO  - Opuscula Math.
JA  - Opuscula Math.
JF  - Opuscula Mathematica
PY  - 2017
VL  - 37
IS  - 5
SP  - 725
EP  - 734
DO  - http://dx.doi.org/10.7494/OpMath.2017.37.5.725
UR  - http://dx.doi.org/10.7494/OpMath.2017.37.5.725
AB  - A \(k\)-total edge product cordial labeling is a variant of the well-known cordial labeling. In this paper we characterize connected graphs of order at least 15 admitting a 3-total edge product cordial labeling.
KW  - 3-total edge product cordial labelings
KW  - 3-TEPC graphs
SN  - 1232-9274
ER  -