On the minimum number of edges of two-connected graphs with given diameter
type: Item
instance of: scholarly article
title: On the minimum number of edges of two-connected graphs with given diameter
zbMATH Open document ID: 1238.05137
published in: Discrete Mathematics
publication date: 2012-04-13T00:00:00Z
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C12
zbMATH DE Number: 6023635
zbMATH Keywords: 2-connectedness
zbMATH Keywords: diameter
MaRDI profile type: Publication
full work available at URL: j.disc.2011.11.017
OpenAlex ID: W1976569371
cites work: The smallest number of edges in a 2-connected graph with specified diameter
cites work: Q3039368
cites work: A problem of the theory of communication networks
cites work: Extremal graphs of diameter 4
cites work: Q3870926
cites work: Extremal 2-connected graphs with given diameter
cites work: On Moore Graphs with Diameters 2 and 3
cites work: On some extremal graphs
cites work: Q5589881
cites work: Q5345644
cites work: There is No Irregular Moore Graph
cites work: Extremal graphs of diameter at most 6 after deleting any vertex
DOI: 10.1016/J.DISC.2011.11.017
author: Aubin Jarry
author: A. Laugier
description: scientific article; zbMATH DE number 6023635