Detour self-decomposition of corona product of graphs

Authors

  • E Ebin Raja Merly Affiliated to Manonmanium Sundaranar University, Abishekapatti, Tirunelveli, Tamilnadu- 627012, India (Associate Professor and Head, Department of Mathematics, Nesamony Memorial Christian College, Marthandam, Tamilnadu-629165, India);
  • E Anlin Bena Affiliated to Manonmanium Sundaranar University, Abishekapatti, Tirunelveli, Tamilnadu- 627012, India.(Research Scholar (Reg.No:20213112092038), Department of Mathematics, Nesamony Memorial Christian College, Marthandam, Tamilnadu-629165, India.)

DOI:

https://doi.org/10.23755/rm.v50i0.1545

Keywords:

Detour number, Detour self-decomposition, Detour selfdecomposition number, Corona product

Abstract

Decomposition of a graph G is the collection of edge-disjoint subgraphs of G. The longest distance between any two vertices of G is its detour distance. A subset S of V (G) is a detour set if every vertex of G lie on some u − v detour path, where u, v ∈ S. If a graph G can be decomposed into subgraphs G1,G2, ...,Gn with same detour number
as G then the decomposition Π = (G1,G2, ...,Gn) is called detour self-decomposition. The cardinality of maximum such possibility of detour self-decomposition in G is the detour self-decomposition number of G and is denoted by πsdn(G). The bounds of detour selfdecomposition number of corona product of graphs based on few properties have been discussed here.

Downloads

Download data is not yet available.

Author Biographies

  • E Ebin Raja Merly, Affiliated to Manonmanium Sundaranar University, Abishekapatti, Tirunelveli, Tamilnadu- 627012, India (Associate Professor and Head, Department of Mathematics, Nesamony Memorial Christian College, Marthandam, Tamilnadu-629165, India);

    Affiliated to Manonmanium Sundaranar University, Abishekapatti, Tirunelveli, Tamilnadu- 627012, India (Associate Professor and Head, Department of Mathematics, Nesamony Memorial Christian College, Marthandam, Tamilnadu-629165, India)

  • E Anlin Bena, Affiliated to Manonmanium Sundaranar University, Abishekapatti, Tirunelveli, Tamilnadu- 627012, India.(Research Scholar (Reg.No:20213112092038), Department of Mathematics, Nesamony Memorial Christian College, Marthandam, Tamilnadu-629165, India.)

    Affiliated to Manonmanium Sundaranar University, Abishekapatti, Tirunelveli, Tamilnadu- 627012, India.(Research Scholar (Reg.No:20213112092038), Department of Mathematics, Nesamony Memorial Christian College, Marthandam, Tamilnadu-629165, India.)

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.

Downloads

Published

2023-12-29

Similar Articles

1-10 of 142

You may also start an advanced similarity search for this article.

Most read articles by the same author(s)