Moore bound for mixed networks期刊界 All Journals 搜尽天下杂志传播学术成果专业期刊搜索期刊信息化学术搜索

Moore bound for mixed networks

Authors:	Minh Hoang Nguyen Mirka Miller

Affiliation:	^a Hutchison Managed Service - Ericsson Australia, 112-118 Talavera Road, North Ryde, NSW 2113, Australia ^b School of Information Technology and Mathematical Sciences, University of Ballarat, P.O. Box 663, Vic 3353, Australia ^c Department of Mathematics, University of West Bohemia, Pilsen, Czech Republic

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.

Keywords:	Mixed Moore graph Mixed Moore bound mmlsi1" onclick=" submitCitation('/science?_ob=MathURL& _method=retrieve& _eid=1-s2.0-S0012365X07008023& _mathId=si1.gif& _pii=S0012365X07008023& _issn=0012365X& _acct=C000069490& _version=1& _userid=6211566& md5=ef8c96407ba1d3761f20533d7913033f')" style=" cursor:pointer " alt=" Click to view the MathML source" title=" Click to view the MathML source" > formulatext" title=" click to view the MathML source" >T-graph Tied graphs
本文献已被 ScienceDirect 等数据库收录！