✦ LIBER ✦

Arrangement graphs: a class of generalized star graphs

✍ Scribed by Khaled Day; Anand Tripathi

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 602 KB
Volume: 42
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(92)90030-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The (n, k)-star graph: A generalized sta

The (n, k)-star graph: A generalized star graph

✍ Chiang Wei-Kuo; Chen Rong-Jaye 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 515 KB

A general class of invulnerable graphs

✍ F. T. Boesch; A. P. Felzer 📂 Article 📅 1972 🏛 John Wiley and Sons 🌐 English ⚖ 1004 KB

The idea of u t i Z i z i n g the connectivity properties of a graph as measures of i t s vulnerability has been welZ docwnented. graph t h e o r e t i c concepts and the b a s i c resuZts of t h i s theory are r e v i m e d here. are defined and compared. SpecificaZZy a class of graphs called teZe

On a general class of graph polynomials

✍ E.J Farrell 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 697 KB

Generalized neighbourhoods and a class o

Generalized neighbourhoods and a class of perfectly orderable graphs

✍ M. Cochand; D. de Werra 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 318 KB

On a class of graphs without 3-stars

✍ A. A. Makhnev 📂 Article 📅 1998 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 422 KB

Skeletal graphs — a new class of perfect

Skeletal graphs — a new class of perfect graphs

✍ A. Hertz 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 431 KB

Let S be an arbitrary collection of stars in a graph G such that there is no chain of length ~3 joining the centers of (any) two stars in G. We consider the graphs that can be obtained by deleting in a parity graph all the edges of such a set S. These graphs will be called skeletal graphs and we pro