Minimum size of a graph or digraph of given radius
type: Item
instance of: scholarly article
title: Minimum size of a graph or digraph of given radius
zbMATH Open document ID: 1197.05076
author: Peter Dankelmann
author: Lutz Volkmann
published in: Information Processing Letters
publication date: 2010-08-20T00:00:00Z
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C12
zbMATH DE Number: 5773836
zbMATH Keywords: interconnection networks
zbMATH Keywords: graph
zbMATH Keywords: digraph
zbMATH Keywords: radius
zbMATH Keywords: minimum degree
zbMATH Keywords: size
describes a project that uses: GRAFFITI
MaRDI profile type: Publication
full work available at URL: j.ipl.2009.06.001
OpenAlex ID: W2005549991
cites work: Q5461702
cites work: Q5442174
cites work: The number of edges in a bipartite graph of given radius
cites work: Radius of \((2k-1)\)-connected graphs
cites work: Radius, diameter, and minimum degree
cites work: Maximum induced trees in graphs
cites work: Q3781134
cites work: Q5516082
cites work: An upper bound for the radius of a 3-connected graph
cites work: On the radius of graphs
cites work: Q5616731
cites work: Q3620555
cites work: Q5541882
DOI: 10.1016/J.IPL.2009.06.001
description: scientific article; zbMATH DE number 5773836