Some network topological notions of the Mycielskian of a graph

DOI10.1016/j.akcej.2016.02.005zbMath1346.05047OpenAlexW2332701523MaRDI QIDQ322045

K. S. Savitha, Ambat Vijayakumar

Publication date: 14 October 2016

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.akcej.2016.02.005

zbMATH Keywords

fault diameterwide diameter\((l, k)\)-dominationdiameter vulnerabilityMycielskian

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

The generalized 3-connectivity of the Mycielskian of a graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Diameter vulnerability of graphs
• Fault diameter of interconnection networks
• Hamiltonicity, diameter, domination, packing, and biclique partitions of Mycielski's graphs
• Super connectivity and super edge connectivity of the Mycielskian of a graph
• Connectivity of the Mycielskian of a graph
• Containers and wide diameters of $P_3(G)$
• Diameter bounds for altered graphs
• A textbook of graph theory

This page was built for publication: Some network topological notions of the Mycielskian of a graph