- Title
- Multipartite Moore digraphs
- Creator
- Fiol, M. A.; Gimbert, Joan; Miller, Mirka
- Date
- 2006
- Type
- Text; Journal article
- Identifier
- http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/46001
- Identifier
- vital:286
- Identifier
-
https://doi.org/10.1016/j.laa.2006.04.020
- Identifier
- ISSN:0024-3795
- Abstract
- We derive some Moore-like bounds for multipartite digraphs, which extend those of bipartite digraphs, under the assumption that every vertex of a given partite set is adjacent to the same number δ of vertices in each of the other independent sets. We determine when a multipartite Moore digraph is weakly distance-regular. Within this framework, some necessary conditions for the existence of a r-partite Moore digraph with interpartite outdegree δ > 1 and diameter k = 2m are obtained. In the case δ = 1, which corresponds to almost Moore digraphs, a necessary condition in terms of the permutation cycle structure is derived. Additionally, we present some constructions of dense multipartite digraphs of diameter two that are vertex-transitive.; C1
- Publisher
- Elsevier
- Relation
- Linear Algebra and Its Applications Vol. 419, no. 1 (2006), p. 234-250
- Rights
- Copyright Elsevier
- Rights
- This metadata is freely available under a CCO license
- Subject
- 0101 Pure Mathematics; Degree/diameter problem; Eigenvalues; Moore digraphs; Multipartite digraphs; Weakly distance-regular digraph; Eigenvalues and eigenfunctions; Linear algebra; Mathematical transformations
- Reviewed
- Hits: 1192
- Visitors: 1193
- Downloads: 1
| Thumbnail | File | Description | Size | Format |
|---|