1984/09/01 by Delorme, Farhi · 30 citations
Computer Science · Mathematics · #Interconnection Networks and Systems #Graph theory and applications #Advanced Graph Theory Research #Combinatorics #Degree (music) #Mathematics #Chordal graph #Interconnection #Indifference graph #Discrete mathematics #Metric dimension #Pathwidth #Graph #1-planar graph #Computer science #Line graph #Physics #Telecommunications
paper · doi:10.1109/tc.1984.1676504
published in IEEE Transactions on Computers C-33(9), 857-860 (Institute of Electrical and Electronics Engineers)
openalex publication_date 1984/09/01 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/07
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△∞inf N(△, D).△-D ≥ 2-D, where N(△, D) is the maximum number of vertices of a graph with degree A and diameter D.