New Largest Known Graphs of Diameter 6
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F09%3A00503064" target="_blank" >RIV/49777513:23520/09:00503064 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
New Largest Known Graphs of Diameter 6
Original language description
In the pursuit of obtaining largest graphs of given maximum degree and diameter, many construction techniques have been developed. Compounding of graphs is one such technique. In this article, by means of the compounding of complete graphs into a bipartite Moore graph of diameter 6, we obtain a family of large graphs of the same diameter. For maximum degrees 5, 6, 9, 12, and 14, members of this family constitute the largest known graphs of diameter 6.
Czech name
—
Czech description
—
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
2009
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
Networks
ISSN
0028-3045
e-ISSN
—
Volume of the periodical
53
Issue of the periodical within the volume
4
Country of publishing house
US - UNITED STATES
Number of pages
14
Pages from-to
—
UT code for WoS article
—
EID of the result in the Scopus database
—