✦ LIBER ✦

Infinite generalized friendship graphs

✍ Scribed by Charles Delorme; Geňa Hahn

Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 312 KB
Volume: 49
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(84)90162-6

No coin nor oath required. For personal study only.

✦ Synopsis

We give necessary and sufficient conditions for the existence of infinite generalized friendship graphs and show that there are 2 c non-isomorphic ones of each admissible order c and chromatic number. Further we prove that such graphs and their complements are almost always regular of degree equal to the order and that various generalizations of the Friendship Theorem do not hold for infinite generalized friendship graphs. * NSERC support is gratefully acknowledged.

📜 SIMILAR VOLUMES

Symmetric graph designs on friendship gr

Symmetric graph designs on friendship graphs

✍ Dalibor Fronc̆ek; Alexander Rosa 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 105 KB 👁 1 views

graph designs on friendship graphs.

Matchable Infinite Graphs

✍ F. Niedermeyer; K.P. Podewski 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 612 KB

We give a new proof of Aharoni's criterion for the existence of perfect matchings in infinite graphs. 1994 Academic Press, Jnc.

Generalized line graphs

✍ Dragoš Cvetkovic̀; Michael Doob; Slobodan Simic̀ 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 775 KB

## Abstract Generalized line graphs extend the ideas of both line graphs and cocktail party graphs. They were originally motivated by spectral considerations. in this paper several (nonspectral) classical theorems about line graphs are extended to generalized line graphs, including the derivation a

Generalized steinhaus graphs

✍ Neal Brand; Margaret Morton 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 584 KB

## Abstract A generalized Steinhaus graph of order __n__ and type __s__ is a graph with __n__ vertices whose adjacency matrix (__a__~i,j~) satisfies the relation magnified image where 2 ≦__i__≦__n__−1, __i__ + __s__(__i__ − 1 ≦ __j__ ≦ __n__, __c__~r,i,j~ ϵ {0,1} for all 0 ≦ __r__ ≦ __s__(__i__) −1

Generalized Cayley graphs

✍ Dragan Marušič; Raffaele Scapellato; Norma Zagaglia Salvi 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 403 KB

## We introduce the concept of generalized Cayley graphs and study their properties, in particular relative to double coverings of graphs.

Reconstruction of infinite graphs

✍ C.St.J.A. Nash-Williams 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 929 KB

The paper recalls several known results concerning reconstruction and edge-reconstruction of infinite graphs, and draws attention to some possibly interesting unsolved problems.