JACIII Vol.27 No.6 pp. 1108-1112
doi: 10.20965/jaciii.2023.p1108

Research Paper:

Square Difference Labeling of Bloom Graph

V. Jude Annie Cynthia* ORCID Icon, P. Poorani*,**, and M. Helda Mercy*** ORCID Icon

*Stella Maris College
446 Bella Illam, Sathyaraj Nagar, Moolakadai, Chennai 600060, India

**Chevalier T. Thomas Elizabeth College for Women
99/15 Manali New Town, Chennai, Tamil Nadu 600103, India

***Department of Information Technology, Panimalar Engineering College
Nazarthpet, Poonamallae, Chennai 600123, India

July 16, 2022
July 10, 2023
November 20, 2023
square difference labeling, square difference graph, bloom graph

A function f of a graph G(p,q) admits square difference labeling if there exists a bijection f:V(G)→{0,1,2,...,p-1} such that the induced function f*:E(G)→N given by f*(uv)=|(f(u))2-(f(v))2| ∀uv∈E(G) is distinct. A graph which admits square difference labeling is called square difference graph. The major thrust of this paper is that we have provided an algorithm to find the square difference labeling of bloom graph.

Cite this article as:
V. Cynthia, P. Poorani, and M. Mercy, “Square Difference Labeling of Bloom Graph,” J. Adv. Comput. Intell. Intell. Inform., Vol.27 No.6, pp. 1108-1112, 2023.
Data files:
  1. [1] A. Rosa, “On certain valuations of the vertices of a graph,” Theory of Graphs (Int. Symp.), pp. 349-355, 1967.
  2. [2] J. A. Bondy and U. S. R. Murty, “Graph Theory with Applications,” Palgrave, 1977.
  3. [3] D. A. Xavier and C. J. Deeni, “Bloom graph,” Int. J. of Computing Algorithm, Vol.3, pp. 521-523, 2014.
  4. [4] C. Kujur, D. A. Xavier, and S. A. A. Raja, “Lucky Labeling and Proper Lucky Labeling for Bloom Graph,” IOSR J. of Mathematics, Vol.13, No.2, pp. 52-59, 2017.
  5. [5] J. A. Cynthia and E. Padmavathy, “Signed Cordial Labeling and Signed Product Cordial Labeling of Some Interconnection Networks,” Advances and Applications in Discrete Mathematics, Vol.26, No.1, pp. 35-51, 2021.
  6. [6] A. MahaLakshmi and Y. latha, “A Study of edge labelling of a Bloom graph B(m,n) and its topological properties,” J. of Emerging Technologies and Innovative Research, Vol.6, No.6, pp. 255-263, 2019.
  7. [7] I. A. Arputhamary and M. H. Mercy, “An Analytical Discourse on Strong Edge Coloring for Interference-Free Channel Assignment in Interconnection Networks,” Wireless Personal Communications: An Int. J., Vol.94, No.4, pp. 2081-2094, 2017.
  8. [8] J. A. Gallian, “A Dynamic Survey of Graph Labeling,” The Electronic J. of Combinatorics, 2021.
  9. [9] V. Ajitha, S. Arumugam, and K. A. Germina, “On Square Sum Graphs,” AKCE J. of Graphs and Combinatorics, Vol.6, No.1, pp. 1-18, 2009.
  10. [10] A. U. Maheswari, S. Azhagarasi, and J. B. Samuvel, “Vertex Even Mean and Vertex Odd Mean Labeling for Path Union and Crown on Cycle with Parallel p3 Chords,” Design Engineering, Vol.6, pp. 5775-5792, 2021.
  11. [11] J. Shiama, “Square difference labeling for some graphs,” Int. J. of Computer Application, Vol.44, No.4, pp. 30-33, 2012.
  12. [12] J. Shiama, “Square difference labeling of some path, fan and gear graphs,” Int. J. of Scientific and Engineering Research, Vol.4, Issue 3, 2013.
  13. [13] J. A. Cynthia and P. Poorani, “Square Difference Labeling of Circulant Network G(n;±1,2),” Int. J. of Pure and Applied Mathematics, Vol.109, No.7, pp. 109-113, 2016.
  14. [14] J. A. Cynthia and P. Poorani, “Square Difference Labeling of Torus Network T(m,n),” Int. J. of Pure and Applied Mathematics, Vol.120, No.8, pp. 9-17, 2018.

*This site is desgined based on HTML5 and CSS3 for modern browsers, e.g. Chrome, Firefox, Safari, Edge, Opera.

Last updated on Apr. 22, 2024