✦ LIBER ✦

The generalized S-graphs of diameter 3

✍ Scribed by Jixiang Meng

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 459 KB
Volume: 140
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)e0130-v

No coin nor oath required. For personal study only.

✦ Synopsis

A graph is called a generalized S-graph if for every vertex v of G there exists exactly one vertex which is more remote from v than every vertex adjacent to v. A generalized S-graph of diameter 3 is called reducible if there is a pair of diametrical vertices v and t~ such that G-{u, ~} is also a generalized S-graph of diameter 3. Here we determine all irreducible generalized S-graphs of diameter 3.

📜 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

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

Distance regular graphs of diameter 3 an

Distance regular graphs of diameter 3 and strongly regular graphs

✍ A.E Brouwer 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 124 KB

In [1] N.L. Biggs mentions two parameter sets for distance regular graphs that are antipodal covers of a complete graph, for which existence of a corresponding graph was unknown. Here we settle both cases by proving that one does not exist, while there are exactly two nonisomorphic solutions to the

On the diameter of the generalized undir

On the diameter of the generalized undirected de Bruijn graphs UGB(n,m), n2 m ≤ n3

✍ Jyhmin Kuo; Hung-Lin Fu 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 84 KB

## Abstract The generalized de Bruijn digraph __G__~__B__~(__n__,__m__) is the digraph (__V__,__A__) where __V__ = {0, 1,…,__m__ − 1} and (__i__,__j__) ∈ __A__ if and only if __j__ ≡ __i____n__+__α__ (mod __m__) for some __α__ ∈ {0, 1, 2,…,__n__− 1}. By replacing each arc of __G__~__B__~(__n__,__m_

The Diameter of Sparse Random Graphs

✍ Fan Chung; Linyuan Lu 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 150 KB

We consider the diameter of a random graph G n p for various ranges of p close to the phase transition point for connectivity. For a disconnected graph G, we use the convention that the diameter of G is the maximum diameter of its connected components. We show that almost surely the diameter of rand

On bipartite graphs of diameter 3 and de

On bipartite graphs of diameter 3 and defect 2

✍ Charles Delorme; Leif K. Jørgensen; Mirka Miller; Guillermo Pineda-Villavicencio 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 213 KB 👁 1 views

## Abstract We consider bipartite graphs of degree Δ≥2, diameter __D__=3, and defect 2 (having 2 vertices less than the bipartite Moore bound). Such graphs are called bipartite (Δ, 3, −2) ‐graphs. We prove the uniqueness of the known bipartite (3, 3, −2) ‐graph and bipartite (4, 3, −2)‐graph. We al