A Regular Network for Multicomputer Systems
IEEE Transactions on Computers
New Designs for Dense Processor Interconnection Networks
IEEE Transactions on Computers
Torus and Other Networks as Communication Networks With Up to Some Hundred Points
IEEE Transactions on Computers
Some New Results About the (d, k) Graph Problem
IEEE Transactions on Computers - Lecture notes in computer science Vol. 174
Journal of Combinatorial Theory Series B
Complete catalogue of graphs of maximum degree 3 and defect at most 4
Discrete Applied Mathematics
Distance constrained labelings of planar graphs with no short cycles
Discrete Applied Mathematics
Vertex-symmetric generalized Moore graphs
Discrete Applied Mathematics
New families of graphs without short cycles and large size
Discrete Applied Mathematics
On the power of cliques in the parameterized verification of Ad Hoc networks
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Switchings, extensions, and reductions in central digraphs
Journal of Combinatorial Theory Series A
Approaching the Moore bound for diameter two by Cayley graphs
Journal of Combinatorial Theory Series B
Maximum order of planar digraphs
IJCCGGT'03 Proceedings of the 2003 Indonesia-Japan joint conference on Combinatorial Geometry and Graph Theory
Largest graphs of diameter 2 and maximum degree 6
General Theory of Information Transfer and Combinatorics
Girth of {C3,...,Cs} -free extremal graphs
Discrete Applied Mathematics
Polynomial graph transformability
Theoretical Computer Science
Radial Moore graphs of radius three
Discrete Applied Mathematics
Performance of shared-channel multihop lightwave networks
Computer Communications
Survey: Randomly colouring graphs (a combinatorial view)
Computer Science Review
Griggs and Yeh's Conjecture and $L(p,1)$-labelings
SIAM Journal on Discrete Mathematics
Journal of Combinatorial Theory Series A
On a family of strongly regular graphs with λ=1
Journal of Combinatorial Theory Series B
| Hi-index | 0.01 |
This note treats the existence of connected, undirected graphs homogeneous of degree d and of diameter k, having a number of nodes which is maximal according to a certain definition. For k = 2 unique graphs exist for d = 2, 3, 7 and possibly for d = 57 (which is undecided), but for no other degree. For k = 3 a graph exists only for d = 2. The proof exploits the characteristic roots and vectors of the adjacency matrix (and its principal submatrices) of the graph.