✦ LIBER ✦

Symmetric graph designs on friendship graphs

✍ Scribed by Dalibor Fronc̆ek; Alexander Rosa

Publisher: John Wiley and Sons
Year: 2000
Tongue: English
Weight: 105 KB
Volume: 8
Category: Article
ISSN: 1063-8539
DOI: 10.1002/(sici)1520-6610(2000)8:3<201::aid-jcd5>3.0.co;2-#

No coin nor oath required. For personal study only.

✦ Synopsis

graph designs on friendship graphs.

📜 SIMILAR VOLUMES

Partition graphs for finite symmetric gr

Partition graphs for finite symmetric groups

✍ Conder, Marston; Morton, Margaret; Praeger, Cheryl E. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 130 KB 👁 1 views

This paper outlines an investigation of a class of arc-transitive graphs admitting a f inite symmetric group S n acting primitively on vertices, with vertex-stabilizer isomorphic to the wreath product S m wr S r (preserving a partition of {1, 2, . . . , n} into r parts of equal size m). Several prop

The symmetric (2k, k)-graphs

✍ Matthias Kriesell 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 166 KB 👁 1 views

Designing bar graphs: orientation matter

Designing bar graphs: orientation matters

✍ Martin H. Fischer; Nele Dewulf; Robin L. Hill 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 84 KB

On subpancyclic line graphs

✍ Xiong, Liming 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 160 KB

We give a best possible Dirac-like condition for a graph G so that its line graph L(G) is subpancyclic, i.e., L(G) contains a cycle of length l for each l between 3 and the circumference of G. The result verifies the conjecture posed by Xiong (Pancyclic results in hamiltonian line graphs, in:

On wing-perfect graphs

✍ Hougardy, Stefan 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 342 KB

An edge in a graph G is called a wing if it is one of the two nonincident edges of an induced P 4 (a path on four vertices) in G. For a graph G, its winggraph W (G) is defined as the graph whose vertices are the wings of G, and two vertices in W (G) are connected if the corresponding wings in G belo

On critically perfect graphs

✍ Wagler, Annegret 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 337 KB

A perfect graph is critical, if the deletion of any edge results in an imperfect graph. We give examples of such graphs and prove some basic properties. We relate critically perfect graphs to well-known classes of perfect graphs, investigate the structure of the class of critically perfect graphs, a