An upper bound on the diameter of a 3-edge-connected C₄-free graph

DOI10.1007/S13226-020-0505-6MaRDI QIDQ828980zbMATH OpenOpenAlexFDO

Authors Blessings T. Fundikwa, Simon Mukwembi, J. P. 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)

Recommendations

• Diameter, edge-connectivity, and \(C_4\)-freeness
• An upper bound on the radius of a 3-edge-connected \(C_4\)-free graph
• An upper bound on the radius of a 3-vertex-connected C₄-free graph
• Upper bounds on the diameter of bipartite and triangle-free graphs with prescribed edge connectivity
• On size, order, diameter and edge-connectivity of graphs

Cites work

• scientific article; zbMATH DE number 5006840 (Why is no real title available?)
• scientific article; zbMATH DE number 4137792 (Why is no real title available?)
• scientific article; zbMATH DE number 5543113 (Why is no real title available?)
• scientific article; zbMATH DE number 4041962 (Why is no real title available?)
• scientific article; zbMATH DE number 90560 (Why is no real title available?)
• scientific article; zbMATH DE number 2188620 (Why is no real title available?)
• An upper bound for the radius of a 3-connected graph
• An upper bound on the radius of a 3-edge-connected graph
• Diameters in graphs
• On the diameter of a graph
• On the radius of graphs
• Radius of \((2k-1)\)-connected graphs
• Radius, diameter and the degree sequence of a graph
• Radius, diameter, and minimum degree
• Stability, domination and irredundance in a graph
• The Diameter of a Graph and its Complement

Cited in

(7)

• An upper bound on the radius of a 3-edge-connected \(C_4\)-free graph
• An upper bound on the radius of a 3-vertex-connected C₄-free graph
• On size, order, diameter and edge-connectivity of graphs
• Upper bounds on the diameter of bipartite and triangle-free graphs with prescribed edge connectivity
• Diameter, edge-connectivity, and \(C_4\)-freeness
• Edge-fault diameter of \(C_4\)-free graphs
• scientific article; zbMATH DE number 2188620 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q828980)