✦ LIBER ✦

A generalisation of the diameter of a graph

✍ Scribed by Douglas D. Grant

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 262 KB
Volume: 90
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(91)90153-s

No coin nor oath required. For personal study only.

✦ Synopsis

We prove the following theorem. If G b a connected finite graph of order p, and S is a k-subset of V(G) (where k 2 2), then there is a pair of vertices in S which are at a dbtance ~2 [(p -1)/k]

if k does not divide p, and ~2 I@ -1)/k j + 1 otherwise.

📜 SIMILAR VOLUMES

The generalized diameter of a graph

✍ Chih-Kang Eric Chen; R. S. Garfinkel 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 198 KB

## Abstract We generalize the concept of the diameter of a graph __G__ = (__N, A__) to allow for location of points not on the nodes. It is shown that there exists a finite set of candidate points which determine this __generalized diameter.__ Given the matrix of shortest paths, an __o__ (|__A__|^2

Automorphism group and diameter of a gra

Automorphism group and diameter of a graph

✍ P. Dankelmann; D. Erwin; S. Mukwembi; B. G. Rodrigues; E. Mwambene; G. Sabidussi 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 178 KB 👁 1 views

## Abstract Given a connected graph Γ of order __n__ and diameter __d__, we establish a tight upper bound for the order of the automorphism group of Γ as a function of __n__ and __d__, and determine the graphs for which the bound is attained. © 2011 Wiley Periodicals, Inc. J Graph Theory.

The diameter of an orientation of a comp

The diameter of an orientation of a complete multipartite graph

✍ K.M. Koh; B.P. Tan 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 390 KB

For a graph G, let e(G) denote the minimum value of the diameters diamD of D, where D runs through all the orientations of G. In this paper, we obtain some results on e(G) for complete multipartite graphs G, which extend some known results due to Boesch and Tindell [1] and Maurer [4].

On the Spectrum, the Growth, and the Dia

On the Spectrum, the Growth, and the Diameter of a Graph

✍ N. Hajaj 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 171 KB

A lower bound is given for the harmonic mean of the growth in a finite undirected graph 1 in terms of the eigenvalues of the Laplacian of 1. For a connected graph, this bound is tight if and only if the graph is distance-regular. Bounds on the diameter of a ``sphere-regular'' graph follow. Finally,

A generalization of Moore graphs of diam

A generalization of Moore graphs of diameter two

✍ R.C Bose; T.A Dowling 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 676 KB

A family of graphs and the degree/diamet

A family of graphs and the degree/diameter problem

✍ Geoffrey Exoo 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 64 KB 👁 1 views

## Abstract We investigate a family of graphs relevant to the problem of finding large regular graphs with specified degree and diameter. Our family contains the largest known graphs for degree/diameter pairs (3, 7), (3, 8), (4, 4), (5, 3), (5, 5), (6, 3), (6, 4), (7, 3), (14, 3), and (16, 2). We a