| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4649955 | Discrete Mathematics | 2008 | 5 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Minh Hoang Nguyen, Mirka Miller,