Large Graphs with Given Degree and Diameter Part I

Authors:
C. Delorme;G. Farhi
Affiliations:
Department of Mathematics, University Paris-Sud;-
Venue:
IEEE Transactions on Computers
Year:
1984

Citing 5
Cited 0

Extremal Graph Theory

Extremal Graph Theory
Dense Trivalent Graphs for Processor Interconnection

IEEE Transactions on Computers
Design to Minimize Diameter on Building-Block Network

IEEE Transactions on Computers
Line Digraph Iterations and the (d, k) Digraph Problem

IEEE Transactions on Computers
Some New Results About the (d, k) Graph Problem

IEEE Transactions on Computers - Lecture notes in computer science Vol. 174

Quantified Score

Hi-index	14.98

Visualization

Abstract

The following problem arises in the study of interconnection networks: find graphs of given diameter and degree having the maximum number of vertices. In this correspondence we give some constructions of graphs proving in particular that lim?8inf N(?, D).?-D = 2-D, where N(?, D) is the maximum number of vertices of a graph with degree A and diameter D.