Moore bound for mixed networks

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.

Topics

2 Figures and Tables

Download Full PDF Version (Non-Commercial Use)