JOURNAL OF THE INDIAN ACADEMY OF MATHEMATICS

(Published by Indian Academy of Mathematics since 1978)

Promoting Research in Pure and Applied Mathematics

ISSN 0970-5120


HomeArchiveContents
← Back to Volume 47, Issue 1 Contents

VECTOR BASIS S-CORDIAL LABELING OF FRIENDSHIP GRAPH, FAN GRAPH, AND LILLY GRAPH

R. Ponraj1, R. Jeya2
1 Department of Mathematics, Sri Paramakalyani College, Alwarkurichi - 627412, Tenkasi dt, Tamilnadu, India
2 Research Scholar, Reg. No. 22222102092010, Department of Mathematics, Sri Paramakalyani College, Alwarkurichi-627412, Tamilnadu, India (Affiliated to Manonmaniam Sundaranar University, Abhishekapatti,
Volume: 47Issue: 1Pages: 169–180Year: 2025ISSN: 0970-5120
⬇ Download Full PDF

Abstract

Let $G$ be a $(p,q)$ graph. Let $V$ be an inner product space with basis $S$. Let $\varphi:V(G)\to S$ be a map. For each $xy$ assign the label $<x,y>$, where $<x,y>$ denotes the inner product of $x$ and $y$. We say that $\varphi$ is a vector basis $S$-cordial labeling if $|\varphi_x-\varphi_y|\leq 1$ and $|\gamma_i-\gamma_j|\leq 1$ where $\varphi_x$ denotes the number of vertices labeled with the vector $x$ and $\gamma_i$ denotes the number of edges labeled with the scalar $i$. A graph with a vector basis S-cordial labeling is called a vector basis S-cordial graph. In this paper, we investigate the vector basis S-cordial labeling of certain graphs like friendship graph, fan graph, lilly graph, bistar graph, crown graph and armed crown graph where $S=\{(1,1,1,1), (1,1,1,0), (1,1,0,0), (1,0,0,0)\}$ is a basis in $R^4$.
Keywords: Friendship Graph, Fan Graph, Lilly Graph, Bistar Graph, and Crown Graph
MSC 2020: 05C78

How to Cite

R. Ponraj, R. Jeya, VECTOR BASIS S-CORDIAL LABELING OF FRIENDSHIP GRAPH, FAN GRAPH, AND LILLY GRAPH, Journal of the Indian Academy of Mathematics, 47(1) (2025), 169–180.

References

  • S. Amutha and M. Uma Devi (2019): Super graceful labeling for some families of fan graphs, Journal Comput. Math. Sci., Vol. 10(8), pp. 1551-1562.
  • C. M. Barasara (2018): Edge and total edge product cordial labeling of some new graphs, Internat. Engin., Sci. Math., Vol. 7(2), pp. 263-273.
  • J. Baskar Babujee and L. Shobana (2010): Prime and prime cordial labeling for some special graphs, Int. J. Contemp. Math. Sciences, Vol. 5, pp. 2347-2356.
  • I. Cahit (1987): Cordial Graphs: A weaker version of Graceful and Harmonious Graphs, Ars Comb., Vol. 23(3), pp. 201-207.
  • S. N. Daoud (2019): Vertex odd graceful labeling, Ars Combin., Vol. 142, pp. 65-87.
  • A. Gallian (2024): A Dynamic Survey of Graph Labeling, Electronic Journal of Combinatorics, Vol. 27, pp. 1-712.
  • F. Harary (1988): Graph Theory, Narosa Publishing House, New Delhi.
  • V. Hemalatha, V. Mohanaselvi, and K. Amuthavalli (2017): Radio geometric mean labeling of some star like graphs, J. Informatics Math. Sci., 9(3), pp. 969-977.
  • I. N. Herstein (1991): Topics in Algebra, John Wiley & Sons, United States of America.
  • V. J. Kaneria, M J Khoda, and H M Karavadiya (2016): Balanced mean cordial labeling and graph operations, Int. J. Math. Appl., Vol. 4(3-A), pp. 181-184.
  • S. Mitra and S. Bhoumik (2022): Tribonacci cordial labeling of graphs, Journal of Applied Mathematics and Physics, Vol. 10(4), pp. 1394-1402.
  • V. Mohan and A. Sugumaran (2019): Difference cordial labeling for plus and hanging pyramid graphs, Internat. J. Res. Analytical Reviews, Vol. 6(1), pp. 1106-1114.
  • A. Parthiban and Vishally Sharma (2021): Some results on prime cordial labeling of Lilly graphs, Journal of Physics: Conference Series, 1831(012035), pp. 1-10.
  • U. M. Prajapati and A. V. Vantiya (2019): SD-prime cordial labeling of some snake graphs, JASC: J. Appl. Sci. Comput., Vol. VI(IV), pp. 1857-1868.
  • R. Ponraj and R. Jeya: Vector basis S-cordial labeling of graphs (Submitted by the Journal)
  • A. Rosa (1967): On certain valuations of the vertices of a graph, Theory of Graphs, (Internat. Symposium, Rome, July 1966), Gordon and Breach, N. Y. and Dunod Paris, pp. 349-355.
  • A. Sugumaran and K. Rajesh (2017): Sum divisor cordial labeling of theta graph, Annals Pure Appl. Math., Vol. 14(2), pp. 313-320.
  • Y. M. Parmar (2017): Edge vertex prime labeling for wheel, fan and friendship graph, International Journal of Mathematics and Statistics Invention, Vol. 5(8), pp. 23-29.

© Journal of the Indian Academy of Mathematics