Some New Results About the (d, k) Graph Problem

DOI10.1109/TC.1982.1676084zbMath0498.05040OpenAlexW2015206916MaRDI QIDQ3963040

Yves Raillard, G. Memmi

Publication date: 1982

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.1982.1676084

zbMATH Keywords

communication networkmaximum degreeMoore graphdiameter minimization

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02)

Related Items

Tables of large graphs with given degree and diameter, Graphs on alphabets as models for large interconnection networks, Large graphs with given degree and diameter. II