A Study on the Detour Self-Decomposition of Corona Product of Graphs | Chapter 11 | Mathematics and Computer Science: Contemporary Developments Vol. 10

A graph G is said to have a detour self-decomposition Π = (G₁,G₂,...,Gn) if every subgraph G_i,1 ≤ i ≤ n of G have the same detour number as the graph G. Detour self-decomposition number of a graph G as the maximum cardinality of the detour self-decomposition Π and is represented by the π_sdn(G). Detour self-decomposition on corona product of various graphs and the bounds of detour self-decomposition number are studied in this work.

 

Author (s) Details

 

Anlin Bena. E
Department of Mathematics, Nesamony Memorial Christian College, Marthandam, Tamil Nadu-629 165, Affiliated to Manonmaniam Sundaranar University, Abishekapatti, Tirunelveli, Tamil Nadu-627012, India.

 

E. Ebin Raja Merly
Department of Mathematics, Nesamony Memorial Christian College, Marthandam, Tamil Nadu-629 165, India.

 

Please see the book here:- https://doi.org/10.9734/bpi/mcscd/v10/3266