Journal of applied mathematics & informatics

The Korean Society for Computational and Applied Mathematics (한국전산응용수학회)
권호 표지
DOI QR코드

DOI QR Code

POWER CORDIAL GRAPHS

  • C.M. BARASARA (Department of Mathematics, Hemchandracharya North Gujarat University) ;
  • Y.B. THAKKAR (Department of Mathematics, Hemchandracharya North Gujarat University)
  • Received : 2023.11.03
  • Accepted : 2024.02.16
  • Published : 2024.03.30
Download PDF
⟨ Previous Next ⟩

Abstract

A power cordial labeling of a graph G = (V (G), E(G)) is a bijection f : V (G) → {1, 2, ..., |V (G)|} such that an edge e = uv is assigned the label 1 if f(u) = (f(v))n or f(v) = (f(u))n, for some n ∈ ℕ ∪ {0} {0} and the label 0 otherwise, then the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. In this paper, we study power cordial labeling and investigate power cordial labeling for some standard graph families.

Keywords

Acknowledgement

The authors are highly thankful to the anonymous referees for the kind comments and fruitful suggestions on the first draft of this paper.

References

  1. J. Clark and D.A. Holton, A First Look at Graph Theory, World Scientific, London, 1991.
  2. J.A. Gallian, A Dynamic Survey of Graph Labeling, The Electronics Journal of Combinatorics 26 (2023), #DS6.
  3. I. Cahit, Cordial Graphs: A weaker version of graceful and harmonious Graphs, Ars Combinatoria 23 (1987), 201-207.
  4. M. Sundaram, R. Ponraj and S. Somasundram, Prime cordial labeling of graphs, J. Indian Acad. Math. 27 (2005), 373-390.
  5. R. Varatharajan, S. Navanaeethakrishnan and K. Nagarajan, Divisor Cordial Graphs, Int. J. of Mathematics and Combinatorics 4 (2011), 15-25.
  6. M. Sundaram, R. Ponraj and S. Somasundram, Product cordial labeling of graphs, Bull. Pure and Appl. Sci. (Math. & Stat.) 23 (2004), 155-163.
  7. S.K. Vaidya and C.M. Barasara, Edge product cordial labeling of graphs, J. Math.Comput. Science 2 (2012), 1436-1450.