Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4646516 | AKCE International Journal of Graphs and Combinatorics | 2016 | 7 Pages |
Abstract
Efficiency and reliability are two important criteria in the designing of a good interconnection network. Network topological notions such as wide diameter, fault diameter, diameter vulnerability and (l,k)(l,k)-domination can be used to study the efficiency and reliability of a network. In this paper we study these notions in the Mycielskian of a graph and its iterates.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Savitha K.S., Vijayakumar A.,