SSP Structure on the Cartesian Product Sm+1 x Pn
R. Mary Jeya Jothi1, R, Revathi2
1R. Mary Jeya Jothi, Department of Mathematics, Sathyabama Institute of Science and Technology, Chennai (Tamilnadu), India.
2R. Revathi, Department of Mathematics, Sathyabama Institute of Science and Technology, Chennai (Tamilnadu), India
Manuscript received on 01 May 2019 | Revised Manuscript received on 15 May 2019 | Manuscript published on 30 May 2019 | PP: 1102-1104 | Volume-8 Issue-7, May 2019 | Retrieval Number: G6334058719/19©BEIESP
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: In G, if there exists a minimal dominating set in every induced subgraph H which meets all the cliques (maximal), then G is known as Super Strongly Perfect (SSP). This paper investigates the construction of Cartesian product of SSP graphs like star, path graphs. With this investigation, it is analysed the structural properties of stacked book graph with respect to its diameter and domination numbers.
Keyword: Cartesian Product, Minimal Dominating Set, SSP and Stacked Book Graphs.
Scope of the Article: Sustainable Structures.