e-ISSN:0976-5166
p-ISSN:2231-3850


INDIAN JOURNAL OF COMPUTER SCIENCE AND ENGINEERING

Call for Papers

Apr 2019 - Volume 10, Issue 2
Deadline: 5 Apr 2019
Notification: 15 Apr 2019
Publication: 30 Apr 2019

June 2019 - Volume 10, Issue 3
Deadline: 5 June 2019
Notification: 15 June 2019
Publication: 30 June 2019

Indexed in

ABSTRACT

Title : SUPER STRONGLY PERFECT NESS OF SOME INTERCONNECTION NETWORKS
Authors : R. Mary Jeya Jothi, Amutha
Keywords : Super Strongly Perfect Graph, Minimal Dominating Set, Mesh, Torus, Hyper cubes and Grid Networks.
Issue Date : Dec 2012-Jan 2013
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 analyzed the structure of super strongly perfect graphs in some Interconnection Networks, like Mesh, Torus, Hyper cubes and Grid Networks. Along with this investigation, we have characterized the Super Strongly Perfect ness in Mesh, Torus, Hyper cubes and Grid Networks. Also we have given the relationship between diameter, domination and co - domination numbers of Mesh, Torus, Hyper cubes and Grid Networks.
Page(s) : 737-745
ISSN : 0976-5166
Source : Vol. 3, No.6