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

DOI10.1007/S13370-020-00837-7zbMATH Open1488.05156OpenAlexW3090198361MaRDI QIDQ821263FDOQ821263

Authors: Blessings T. Fundikwa, Simon Mukwembi, J. P. Mazorodze 

Publication date: 20 September 2021

Published in: Afrika Matematika (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13370-020-00837-7

Recommendations

• An upper bound on the radius of a 3-vertex-connected \(C_4\)-free graph
• An upper bound on the diameter of a 3-edge-connected \(C_4\)-free graph
• scientific article; zbMATH DE number 5543113
• An upper bound for the radius of a 3-connected graph
• Order and radius of 3-connected graphs

zbMATH Keywords

radiusedge-connectivity

Mathematics Subject Classification ID

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

Cites Work

• Radius, diameter, and minimum degree
• An upper bound on the radius of a 3-edge-connected graph
• Title not available (Why is that?)
• An upper bound for the radius of a 3-connected graph
• Radius of \((2k-1)\)-connected graphs
• Title not available (Why is that?)
• Stability, domination and irredundance in a graph
• On the radius of graphs

Cited In (5)

• Title not available (Why is that?)
• An upper bound on the radius of a 3-vertex-connected \(C_4\)-free graph
• An upper bound on the diameter of a 3-edge-connected \(C_4\)-free graph
• Diameter, edge-connectivity, and \(C_4\)-freeness
• Title not available (Why is that?)

This page was built for publication: An upper bound on the radius 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 Q821263)