A family of graphs and the degree/diameter problem
type: Item
instance of: scholarly article
title: A family of graphs and the degree/diameter problem
zbMATH Open document ID: 0991.05060
author: Geoffrey Exoo
published in: Journal of Graph Theory
publication date: 2002-08-24T00:00:00Z
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 1652668
zbMATH Keywords: regular graph
zbMATH Keywords: degree
zbMATH Keywords: diameter
MaRDI profile type: MaRDI publication profile
full work available at URL: jgt.1007
OpenAlex ID: W4254332264
cites work: Minimal Regular Graphs of Girths Eight and Twelve
DOI: 10.1002/JGT.1007
Recommended article: Q3855211
Recommended article: A note on diameter and the degree sequence of a graph
Recommended article: An Extremal Problem of Graphs with Diameter 2
Recommended article: A generalisation of the diameter of a graph
Recommended article: Diameter determination on restricted graph families
Recommended article: Q4232788
Recommended article: The degree-diameter problem for outerplanar graphs
Recommended article: Some properties of graphs of diameters
Recommended article: Some large graphs with given degree and diameter
Recommended article: On the metric dimension of some families of graphs
review text: Given a suitable permutation \(\sigma\) of \(V(K_n)\), a family of graphs is described with the help of the union of orbits of \(\sigma\) in its action on \(E(K_n)\). Some of the graphs in this family turn out to be the largest known graphs for certain degree/diameter values.
reviewed by: Jozef Širáň
description: scientific article; zbMATH DE number 1652668