Complete characterization of almost moore digraphs of degree three

Title: Complete characterization of almost moore digraphs of degree three
Creator: Baskoro, Edy; Miller, Mirka; Siran, Jozef; Sutton, Martin
Date: 2005
Type: Text; Journal article
Identifier: http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/65886
Identifier: vital:101
Identifier: https://doi.org/10.1002/jgt.20042
Identifier: ISSN:0364-9024
Abstract: It is well known that Moore digraphs do not exist except for trivial cases (degree 1 or diameter 1), but there are digraphs of diameter two and arbitrary degree which miss the Moore bound by one. No examples of such digraphs of diameter at least three are known, although several necessary conditions for their existence have been obtained. In this paper, we prove that digraphs of degree three and diameter k ≥ 3 which miss the Moore bound by one do not exist. © 2004 Wiley Periodicals, Inc.; C1
Publisher: Wiley
Relation: Journal of Graph Theory Vol. 48, no. 2 (2005), p. 112-126
Rights: Copyright Wiley
Rights: This metadata is freely available under a CCO license
Subject: 0101 Pure Mathematics; Degree/diameter problem; Digraphs; Moore bound; Matrix algebra; Problem solving; Theorem proving; Topology; Bounded diameter; Graph theory
Reviewed

		Thumbnail	File	Description	Size	Format