Some diameter notions in lexicographic product of graphs

DOI10.5614/ejgta.2018.6.2.6zbMath1467.05060OpenAlexW2897816696MaRDI QIDQ5009987

M. R. Chithra, Manju K. Menon, Ambat Vijayakumar

Publication date: 23 August 2021

Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.5614/ejgta.2018.6.2.6

zbMATH Keywords

fault diameterwide diameterlexicographic productdiameter vulnerabilitydiameter variability

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph theory (05C99) Graph operations (line graphs, products, etc.) (05C76)

Related Items (1)

Determining the robustness of an interdependent network with a hypergraph model

Cites Work

• Diameter vulnerability of graphs
• Diameter variability of cycles and tori
• Diameter vulnerability of graphs by edge deletion
• Fault diameter of interconnection networks
• Changing and unchanging the diameter of a hypercube
• Diameter increase caused by edge deletion
• Diameter bounds for altered graphs
• THE DIAMETER VARIABILITY OF THE CARTESIAN PRODUCT OF GRAPHS
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Some diameter notions in lexicographic product of graphs