Bibliographic Details
| Title: |
Total Neighborhood Magic Labeling for Complete Graphs. |
| Authors: |
Patel, M. A.1 dr.mahendraapatel@gmail.com, Parmar, Y. M.2 ymp.maths@gmail.com, Bosmia, M. I.1 cosmicmohit@gmail.com, Vihol, P. L.3 viholprakash@vgecg.ac.in, Shukla, H. S.2 hsshukla94@gmail.com, Diwan, D. M.4 dm_diwan@yahoo.com |
| Source: |
IAENG International Journal of Applied Mathematics. Feb2026, Vol. 56 Issue 2, p769-776. 8p. |
| Subjects: |
Complete graphs, Graph labelings, Graph connectivity, Bijections, Mathematics, Graph theory |
| Abstract: |
A total neighborhood magic labeling on a graph with v vertices and e edges is a bijection f taking vertices and edges onto the numbers 1,2,. . ., v+e with the property that there is a constant k such that at any vertex q, Σ p∈N(q) (f (p) + f (pq)) = k, where N(q) is the set of neighborhood vertices of q. A graph which admits a total neighborhood magic labeling is called a total neighborhood magic graph. This paper examines a total neighborhood magic labeling for complete graph with even vertices. [ABSTRACT FROM AUTHOR] |
|
Copyright of IAENG International Journal of Applied Mathematics is the property of International Association of Engineers (IAENG) and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
