Some network topological notions of the Mycielskian of a graph
Savitha K.S., Vijayakumar A.
AKCE International Journal of Graphs and Combinatorics · 2016
doi:10.1016/j.akcej.2016.02.005 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
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)-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.
Abstract licence: CC BY-NC
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.