- Title
- Moore bound for mixed networks
- Creator
- Nguyen, Minh Hoang; Miller, Mirka
- Date
- 2008
- Type
- Text; Journal article
- Identifier
- http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/56589
- Identifier
- vital:655
- Identifier
-
https://doi.org/10.1016/j.disc.2007.09.059
- Identifier
- ISSN:0012-365X
- Abstract
- Mixed graphs contain both undirected as well as directed links between vertices and therefore are an interesting model for interconnection communication networks. In this paper, we establish the Moore bound for mixed graphs, which generalizes both the directed and the undirected Moore bound. Crown Copyright (C) 2007 Published by Elsevier B.V. All rights reserved.
- Publisher
- Elsevier
- Relation
- Discrete Mathematics Vol. 308, no. 23 (Dec 2008), p. 5499-5503
- Rights
- Copyright Elsevier
- Rights
- This metadata is freely available under a CCO license
- Subject
- 0101 Pure Mathematics; Mathematics; Communication networks
- Reviewed
- Hits: 781
- Visitors: 783
- Downloads: 1
| Thumbnail | File | Description | Size | Format |
|---|