Volume 18, Issue 2 (10-2023)
IJMSI 2023, 18(2): 153-168 |
Back to browse issues page
Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
Shanmuga Priya H, Anitha A, Sahul Hamid I. Difference Labeling and Decomposition. IJMSI 2023; 18 (2) :153-168
URL: http://ijmsi.ir/article-1-1667-en.html
URL: http://ijmsi.ir/article-1-1667-en.html
Abstract:
A difference labeling of a graph G is an injective function f : V (G) → N ∪ {0} together with the weight function f∗ on E(G) given by f∗(uv) = |f(u) - f(v)| for every edge uv in G. The collection of subgraphs induced by the edges of the same weight is a decomposition of G and is called the common weight decomposition of G induced by f. Let ϒf denote the collection of all the paths taken from each member of the common weight decomposition induced by f. A difference labeling f of G is said to be a graphoidal difference labeling if ϒf is an acyclic graphoidal decomposition of G. This paper initiates a study on this concepts.
Keywords: Decomposition, Graphoidal difference labeling.
Type of Study: Research paper |
Subject:
General
References
1. B. D. Acharya, E. Sampathkumar, Graphoidal Covers and Graphoidal Covering Number of a Graph, Indian J. pure appl. Math., 18(10), (1987), 882-890.
2. S. Arumugam, I. Sahul Hamid, Simple Path Covers in a Graph, International J. Math. Combin., 3, (2008), 94-104.
3. S. Arumugam, I. Sahul Hamid, Label Graphoidal Covering Number of a Garph, Proceedings of the Group Discussion on Labeling of Discrete Structures and Applications, Mary Matha Arts College, Mananthawady, Eds. B.D. Acharya, S. Arumugam and A. Rosa; Narosa Publishing House, (2007), 77-82.
4. S. Arumugam, J. Suresh Suseela, Acyclic Graphoidal Covers and Path Partitions in a Graph, Discrete Math., 190, (1998), 67-77. [DOI:10.1016/S0012-365X(98)00032-6]
5. S. Arumugam, J. Suresh Suseela, Geodesic Graphoidal Covering Number of a Graph, Journal of the Indian Math. Soc., 72, (2005), 99-106.
6. G. S. Bloom, S. Ruiz, Decompositions into Linear Forests and Difference Labelings of Graphs, Discrete Applied Mathematics, 49, (1994), 61-75. [DOI:10.1016/0166-218X(94)90201-1]
7. G. Chartrand, L. Lesniak, Graphs and Digraphs, Fourth Edition, CRC Press, Boca Raton, 2004.
8. F. Harary, Covering and Packing in Graphs I, Ann. N. Y. Acad. Sci., 175, (1970), 198-205. [DOI:10.1111/j.1749-6632.1970.tb45132.x]
9. F. Harary, A. J. Schwenk, Evolution of the Path Number of a Graph, Covering and Packing in Graphs II, Graph Theory and Computing, Ed. R. C. Road, Academic Press, New York, (1972), 39-45. [DOI:10.1016/B978-1-4832-3187-7.50009-X]
10. S. Meena, Studies in Graph Theory Factorizations and Decompositions of Graphs, Doctoral Thesis, Manonmaniam Sundaranar University, India, 1999.
11. I. Sahul Hamid, A. Anitha, On the Label Graphoidal Covering Number-I, Transaction on Combinatorics, 1(4), (2012), 25-33.
12. I. Sahul Hamid, A. Anitha, On the Label Graphoidal Covering Number-II, Discrete Mathematics, Algorithms and Applications, 3(1), (2011), 1-7. [DOI:10.1142/S179383091100095X]
13. M. T. Varela, On Barycentric-Magic Graphs, Iranian Journal of Mathematical Sciences and Informatics, 10(1), (2015), 121-129.
14. Wai-Chee Shiu, Gee-Choon Lau and Sin-Min Lee, On (semi-) Edge-primality of Graphs, Iranian Journal of Mathematical Sciences and Informatics, 12(2), (2017), 1-14.
| Rights and permissions | |
 |
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License. |
