✦ LIBER ✦

Diameter of the conjunction of two finite graphs

✍ Scribed by Roger H. Lamprey

Publisher: John Wiley and Sons
Year: 1978
Tongue: English
Weight: 227 KB
Volume: 2
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190020411

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Reduced graphs of diameter two

✍ Hong-Jian Lai 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 444 KB

## Abstract A graph __H__ is __collapsible__ if for every subset X ⊆ __V(H), H__ has a spanning connected subgraph whose set of odd‐degree vertices is X. In any graph __G__ there is a unique collection of maximal collapsible subgraphs, and when all of them are contracted, the resulting contraction

Diameters of finite upper half plane gra

Diameters of finite upper half plane graphs

✍ Angel, Jeff; Evans, Ronald 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 370 KB 👁 1 views

Let GF(q) be a finite field of q elements. Let G denote the group of matrices M ( z , y) = (," y ) over GF(q) with y # 0. Fix an irreducible polynomial For each a E G F ( q ) , let X , be the graph whose vertices are the q2 -q elements of G, with two vertices M ( z , y), M ( v , w) joined by an edg

Pebbling in diameter two graphs and prod

Pebbling in diameter two graphs and products of paths

✍ Clarke, T. A.; Hochberg, R. A.; Hurlbert, G. H. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 151 KB 👁 1 views

Results regarding the pebbling number of various graphs are presented. We say a graph is of Class 0 if its pebbling number equals the number of its vertices. For diameter d we conjecture that every graph of sufficient connectivity is of Class 0. We verify the conjecture for d = 2 by characterizing t

Maximal and Minimal Vertex-Critical Grap

Maximal and Minimal Vertex-Critical Graphs of Diameter Two

✍ Jing Huang; Anders Yeo 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 446 KB

A graph is vertex-critical if deleting any vertex increases its diameter. We construct, for each & 5 except &=6, a vertex-critical graph of diameter two on & vertices with at least , where c 2 is some constant. We also construct, for each & 5 except &=6, a vertex-critical graph of diameter two on &

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

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