Divisibility conditions in almost Moore digraphs with selfrepeats

Title: Divisibility conditions in almost Moore digraphs with selfrepeats
Creator: Teska, Jakub; Kuzel, Roman; Miller, Mirka
Date: 2006
Type: Text; Journal article
Identifier: http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/62558
Identifier: vital:882
Identifier: https://doi.org/10.1016/j.endm.2006.06.043
Identifier: ISSN:1571-0653
Abstract: Moore digraph is a digraph with maximum out-degree d, diameter k and order Md, k = 1 + d + ... + dk. Moore digraphs exist only in trivial cases if d = 1 (i.e., directed cycle Ck) or k = 1 (i.e., complete symmetric digraph). Almost Moore digraphs are digraphs of order one less than Moore bound. We shall present new properties of almost Moore digraphs with selfrepeats from which we prove nonexistence of almost Moore digraphs for some k and d. © 2006 Elsevier B.V. All rights reserved.; C1
Publisher: Elsevier
Relation: Electronic Notes in Discrete Mathematics Vol. 24, no. (2006), p. 161-163
Rights: Copyright Elsevier
Rights: This metadata is freely available under a CCO license
Subject: 0101 Pure Mathematics; Almost Moore digraph; Diameter; Selfrepeats
Reviewed

		Thumbnail	File	Description	Size	Format