Vertex-symmetric digraphs with small diameter
type: Item
instance of: scholarly article
title: Vertex-symmetric digraphs with small diameter
zbMATH Open document ID: 0822.05033
DOI: 10.1016/0166-218X(93)E0145-O
published in: Discrete Applied Mathematics
publication date: 1995-06-19T00:00:00Z
review text: New families of large vertex-symmetric digraphs with a given maximum out- degree \(\Delta\) and diameter at most \(D\) are presented. The authors use certain digraphs on alphabets and develop new construction techniques. The largest known vertex-symmetric \((\Delta, D)\) digraphs are surveyed in a table.
reviewed by: Ján Plesník
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C12
zbMATH DE Number: 756161
zbMATH Keywords: vertex symmetry
zbMATH Keywords: large vertex-symmetric digraphs
zbMATH Keywords: out-degree
zbMATH Keywords: diameter
zbMATH Keywords: digraphs on alphabets
Wikidata QID: Q57772709
author: Francesc Comellas
author: Miquel Angel Fiol
MaRDI profile type: Publication
cites work: On the impossibility of directed Moore graphs
cites work: Q5834367
cites work: Message Graphs
cites work: New results for the degree/diameter problem
cites work: Q3688411
cites work: Line Digraph Iterations and the (d, k) Digraph Problem
cites work: Determining the Hamilton-connectedness of certain vertex-transitive graphs
cites work: Q5610934
cites work: Q4041603
full work available at URL: 0166-218x(93)e0145-o
OpenAlex ID: W4210553238
description: scientific article; zbMATH DE number 756161