A Study on the Detour Self-Decomposition of Corona Product of Graphs

Authors

  • 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.

DOI:

https://doi.org/10.9734/bpi/mcscd/v10/3266

Keywords:

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

Abstract

A graph G is said to have a detour self-decomposition II = (G1, G2, ..., Gn) if every subgraph Gi, 1 \(\le\) i \(\le\) 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 II and is represented by the \(\pi\)sdn (G). Detour self-decomposition on corona product of various graphs and the bounds of detour self-decomposition number are studied in this work.

Downloads

Published

2024-12-11

How to Cite

Anlin Bena. E, & E. Ebin Raja Merly. (2024). A Study on the Detour Self-Decomposition of Corona Product of Graphs. Mathematics and Computer Science: Contemporary Developments Vol. 10, 163–180. https://doi.org/10.9734/bpi/mcscd/v10/3266

Issue

Mathematics and Computer Science: Contemporary Developments Vol. 10

Section

Chapters