Non-Isomorphic Detour Self-Decomposition Of Graphs
Main Article Content
Abstract
A graph is is said to have a detour self decomposition if every subgraph of have the same detour number as the graph .Detour self decomposition number of a graph is the maximum cardinality of the detour self decomposition and is denoted by . If no two detour self-decomposed subgraphs are isomorphic to each other then that decomposition is non-isomorphic detour self-decomposition and maximum cardinality of such decomposition in is the non-isomorphic detour self-decomposition number of . Few bounds and some general properties satisfied by this decomposition are studied.
Article Details
References
G. Chartrand, L. Johns and P. Zhang, Detour Number of a Graph, Util.Math.,64, 97-113,2003.
S. Elizabath Bernie,S. Joseph Robin and J.John, The Path Induced Detour Number of some graphs, Advances and Applications in Discrete Mathematics, 25(2), 129-141, 2020.
P. Erdos ,A.W. Goodman and L.Posa , The Representation of a Graph by Set Intersections, Canadian Journal of Mathematics, 18, 106-112, 1966.
F.Harary, Graph Theory, Narosa Publishing House, New Delhi, 1988.
E.E.R. Merly and Anlin Bena. E, Detour Self-Decomposition of Graphs, European Chemical Bulletin, 12(Special issue 8), 6111-6120, 2023.
E.E.R. Merly and N. Gnanadhas, Arithmetic Odd Decomposition of Spider Tree, Asian Journal of Current Engineering and Maths, 2, 99-101, 2013.
E.E.R .Merly and M. Mahiba, Steiner decomposition number of graphs, Malaya Journal of Matematik, 1, 560-563, 2021.
E.E.R .Merly and M. Mahiba, Some results on Steiner decomposition number of graphs, Kuwait Journal of Science, 50(2A), 1-15, 2023.
A.P. Santhakumaran and S. Athisayanathan, On the Connected Detour Number of a Graph, Journal of Prime Research in Mathematics, 5, 149-170, 2009.