Opuscula Math. 37, no. 5 (2017), 725-734

Opuscula Mathematica

On 3-total edge product cordial connected graphs

Jaroslav Ivančo

Abstract. 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.

Keywords: 3-total edge product cordial labelings, 3-TEPC graphs.

Mathematics Subject Classification: 05C78.

Full text (pdf)

  • Jaroslav Ivančo
  • P. J. Šafárik University, Institute of Mathematics, Jesenná 5, 041 54 Košice, Slovakia
  • Communicated by Dalibor Fronček.
  • Received: 2016-02-02.
  • Revised: 2017-01-26.
  • Accepted: 2017-01-27.
  • Published online: 2017-07-05.
Opuscula Mathematica - cover

Cite this article as:
Jaroslav Ivančo, On 3-total edge product cordial connected graphs, Opuscula Math. 37, no. 5 (2017), 725-734, http://dx.doi.org/10.7494/OpMath.2017.37.5.725

Download this article's citation as:
a .bib file (BibTeX),
a .ris file (RefMan),
a .enw file (EndNote)
or export to RefWorks.

In accordance with EU legislation we advise you this website uses cookies to allow us to see how the site is used. All data is anonymized.
All recent versions of popular browsers give users a level of control over cookies. Users can set their browsers to accept or reject all, or certain, cookies.