Journal of applied mathematics & informatics

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

DOI QR Code

SOME NEW RESULTS ON POWER CORDIAL LABELING

  • C.M. BARASARA (Department of Mathematics, Hemchandracharya North Gujarat University) ;
  • Y.B. THAKKAR (Department of Mathematics, Hemchandracharya North Gujarat University)
  • Received : 2022.09.29
  • Accepted : 2022.12.19
  • Published : 2023.05.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} 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 investigate power cordial labeling for helm graph, flower graph, gear graph, fan graph and jewel graph as well as larger graphs obtained from star and bistar using graph operations.

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. A.N. Murugan and G. Devakiruba, Cycle Related Divisor Cordial Graphs, Int. J. Math. Trends Tech. 12 (2014), 34-43. https://doi.org/10.14445/22315373/IJMTT-V12P506
  2. A. Rosa, On certain valuations of the vertices of a graph, In Theory of Graphs (International Symposium, Rome, July 1966), Gordon and Breach, N. Y. and Dunod Paris 1967, 349-355.
  3. C.M. Barasara and Y.B. Thakkar, Power Cordial Graphs, Communicated.
  4. G.S. Bloom and S.W. Golomb, Applications of numbered undirected graphs, Proceedings of IEEE 65 (1977), 562-570.
  5. G.S. Bloom, A choronology of Ringle-Kotzig conjecture and the counting quest to call all trees graceful, in: Topics in Graph Theory (edited by F Harary), New York Academy of Sciences 328 (1979), 32-51. https://doi.org/10.1111/j.1749-6632.1979.tb17766.x
  6. I. Cahit, Cordial Graphs: A weaker version of graceful and harmonious Graphs, Ars Combinatoria 23 (1987), 201-207.
  7. J.A. Gallian, A Dynamic Survey of Graph Labeling, The Electronics Journal of Combinatorics 24 (2021), #DS6.
  8. J. Gross and J. Yellen, Graph Theory and its applications, CRC Press, 1999.
  9. P.L.R. Raj and R.L.J. Manoharan, Some results on divisor cordial labeling of graphs, Int. J. Innov. Sci., Eng., Tech. 1 (2014), 226-231.
  10. R.L. Graham and N.J.A. Sloane, On additive bases and harmonious graphs, SIAM J. Alg. Discrete Methods 1 (1980), 382-404. https://doi.org/10.1137/0601045
  11. R. Varatharajan, S. Navanaeethakrishnan and K. Nagarajan, Divisor Cordial Graphs, Int. J. of Mathematics and Combinatorics 4 (2011), 15-25.
  12. R. Varatharajan, S. Navanaeethakrishnan and K. Nagarajan, Special Classes of Divisor Cordial Graphs, Int. Mathematical Forum 7 (2012), 1737-1749.
  13. S.K. Vaidya and N.H. Shah, Some star and bistar related divisor cordial graphs, Annals Pure Appl. Math. 3 (2013), 67-77.
  14. S.K. Vaidya and N.H. Shah, Further results on divisor cordial labeling, Annals Pure Appl. Math. 4 (2013), 150-159.
  15. S.W. Golomb, How to number a graph, in Graph Theory and Computing, R. C. Read, ed., Academic Press, New York, 1972, 23-37.