An upper bound on the diameter of a 3-edge-connected \(C_4\)-free graph
type: Item
instance of: scholarly article
title: An upper bound on the diameter of a 3-edge-connected \(C_4\)-free graph
zbMATH Open document ID: 1462.05121
author: Blessings T. Fundikwa
author: Simon Mukwembi
author: J. P. Mazorodze
published in: Indian Journal of Pure \& Applied Mathematics
publication date: 2021-05-05T00:00:00Z
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 7344164
zbMATH Keywords: diameter
zbMATH Keywords: edge-connectivity
MaRDI profile type: Publication
full work available at URL: s13226-020-0505-6
OpenAlex ID: W3119562306
cites work: Q3470486
cites work: Q5461702
cites work: Q5442174
cites work: Radius of \((2k-1)\)-connected graphs
cites work: Radius, diameter, and minimum degree
cites work: Q3781134
cites work: Stability, domination and irredundance in a graph
cites work: An upper bound for the radius of a 3-connected graph
cites work: On the radius of graphs
cites work: The Diameter of a Graph and its Complement
cites work: On the diameter of a graph
cites work: Radius, Diameter and the Degree Sequence of a Graph
cites work: Q3620555
cites work: Diameters in graphs
cites work: Q4018732
cites work: Q3366921
DOI: 10.1007/S13226-020-0505-6
description: scientific article; zbMATH DE number 7344164