Title :
Super Strongly Perfect ness of Prism and Rook´s Networks
Author :
Jeya Jothi, R. Mary ; Amutha, A.
Author_Institution :
Dept. of Math., Sathyabama Univ., Chennai, India
Abstract :
A Graph G is Super Strongly Perfect Graph if every induced sub graph H of G possesses a minimal dominating set that meets all the maximal complete sub graphs of H. In this paper we have characterized the structure of super strongly perfect graphs in Prism and Rook´s Networks. Along with this characterization, we have investigated the Super Strongly Perfect ness in Prism and Rook´s Networks. Also we have given the relationship between diameter, domination and co-domination numbers of Prism Network.
Keywords :
graph theory; network theory (graphs); set theory; Prism-and-Rook network; codomination number; diameter number; domination number; minimal dominating set; subgraph; super strongly perfect graph; Bipartite graph; Informatics; Mobile communication; Multiprocessor interconnection; Pattern recognition; Minimal dominating Set; Prism and Rook´s Networks; Super Strongly Perfect Graph;
Conference_Titel :
Pattern Recognition, Informatics and Mobile Engineering (PRIME), 2013 International Conference on
Conference_Location :
Salem
Print_ISBN :
978-1-4673-5843-9
DOI :
10.1109/ICPRIME.2013.6496506
