Cordial Labeling of the Line Graph of Bistar

Authors

Keywords:

Line Graph, Bistar, Cordial Labeling

Abstract

A binary vertex labeling f of a graph G is called a cordial labeling if |vf (0) − vf (1)| ≤ 1 and |ef (0) − ef (1)| ≤ 1. A graph which admits cordial labeling is called a cordial graph.
In this paper, the necessary and sufficient conditions for the line graph of Bistar Bn,p to be cordial when p = n + 4m and p = n+4m+2 where m ∈ N ∪ {0} are discussed.

Downloads

Download data is not yet available.

References

M. I. Bosmia and K. K. Kanani, Various graph labeling techniques for the line graph of Bistar, International Journal of Technical Innovation in Modern Engineering & Science, 4(9) (2018), 851 – 858.

D. M. Burton, Elementary Number Theory, McGraw-Hill Publisher, Seventh Edition, (2010).

I. Cahit, Cordial Graphs: A weaker version of graceful and harmonious graphs, Ars Combinatoria, 23 (1987), 201 – 207.

J. A. Gallian, A dynamic survey of graph labeling, The Electronic Journal of Combinatorics, 26 (2023), # DS6.

J. Gross and J. Yellen, Graph Theory and its Applications, CRC Press, (2005).

S. K. Vaidya, C. M. Barasara, Product cordial labeling of line graph of some graphs, Kragujevac Journal of Mathematics, 40(2) (2016), 290 – 297.

S. K. Vaidya, N. H. Shah, Cordial labeling of some bistar related graphs, International Journal of Mathematics and Soft computing, 4(2) (2014), 33 – 39.

Published

19-02-2026

How to Cite

BOSMIA, M., PATEL, M., PARMAR, Y., & VIHOL, P. . (2026). Cordial Labeling of the Line Graph of Bistar. Communications in Mathematics and Applications, 16(3). Retrieved from https://www.rgnpublications.com/journals/index.php/cma/article/view/3317

Issue

Section

Research Article