Moore bound for mixed networks
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F08%3A00501459" target="_blank" >RIV/49777513:23520/08:00501459 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Moore bound for mixed networks
Original language description
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.
Czech name
Mooreova mez pro smíšené grafy
Czech description
Smíšené grafy obsahují orientované i neorientované hrany a jsou tudíž zajímavým modelem komunikačních sítí. V článku je určena Mooreova mez pro smíšené grafy, která je zobecněním Mooreovy meze pro orientované i neorientované grafy.
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2008
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Discrete Mathematics
ISSN
0012-365X
e-ISSN
—
Volume of the periodical
308
Issue of the periodical within the volume
23
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
5
Pages from-to
—
UT code for WoS article
000260737200016
EID of the result in the Scopus database
—