Super Strongly Perfect Ness of Some Interconnection Networks
نویسنده
چکیده
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.
منابع مشابه
Matching preclusion for vertex-transitive networks
In interconnection networks, matching preclusion is a measure of robustness when there is a link failure. Let G be a graph of even order. The matching preclusion number mp(G) is defined as the minimum number of edges whose deletion results in a subgraph without perfect matchings. Many interconnection networks are super matched, that is, their optimal matching preclusion sets are precisely those...
متن کاملk-Restricted edge connectivity for some interconnection networks
k-Restricted edge connectivity is an important parameter in measuring the reliability and fault tolerance of large interconnection networks. In this paper we present two families of graphs similar with the networks proposed by Chen et al. [Y.C. Chen, J.J.M. Tan, L.H. Hsu, S.S. Kao, Super-connectivity and super edge-connectivity for some interconnection networks, Applied Mathematics and Computat...
متن کاملOn Super and Restricted Connectivity of Some Interconnection Networks
The super (resp., edge-) connectivity of a connected graph is the minimum cardinality of a vertex-cut (resp., an edge-cut) whose removal does not isolate a vertex. In this paper, we consider the two parameters for a special class of graphs G(G0, G1; M), proposed by Chen et al [Applied Math. and Computation, 140 (2003), 245-254], obtained from two k-regular k-connected graphs G0 and G1 with the ...
متن کاملConditional matching preclusion for hypercube-like interconnection networks
The conditional matching preclusion number of a graph with n vertices is the minimum number of edges whose deletion results in a graph without an isolated vertex that does not have a perfect matching if n is even, or an almost perfect matching if n is odd. We develop some general properties on conditional matching preclusion and then analyze the conditional matching preclusion numbers for some ...
متن کاملPerformance Analysis of a New Neural Network for Routing in Mesh Interconnection Networks
Routing is one of the basic parts of a message passing multiprocessor system. The routing procedure has a great impact on the efficiency of a system. Neural algorithms that are currently in use for computer networks require a large number of neurons. If a specific topology of a multiprocessor network is considered, the number of neurons can be reduced. In this paper a new recurrent neural ne...
متن کامل