An upper bound on the diameter of a 3-edge-connected \(C_4\)-free graph

DOI10.1007/s13226-020-0505-6zbMath1462.05121OpenAlexW3119562306MaRDI QIDQ828980

Blessings T. Fundikwa, Simon Mukwembi, Jaya Percival Mazorodze

Publication date: 5 May 2021

Published in: Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13226-020-0505-6

zbMATH Keywords

diameteredge-connectivity

Mathematics Subject Classification ID

Distance in graphs (05C12) Connectivity (05C40)

Related Items (2)

Edge-fault diameter of \(C_4\)-free graphs ⋮ Diameter, edge-connectivity, and \(C_4\)-freeness

Cites Work

• On the radius of graphs
• Radius, diameter, and minimum degree
• An upper bound for the radius of a 3-connected graph
• On the diameter of a graph
• The Diameter of a Graph and its Complement
• Stability, domination and irredundance in a graph
• Diameters in graphs
• Radius, Diameter and the Degree Sequence of a Graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An upper bound on the diameter of a 3-edge-connected \(C_4\)-free graph