✦ LIBER ✦

Geometric Characterization of Graphs from the Suzuki Chain

✍ Scribed by Dmitrii V. Pasechnik

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 332 KB
Volume: 14
Category: Article
ISSN: 0195-6698
DOI: 10.1006/eujc.1993.1051

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the characterization of path graphs

✍ Huaien Li; Yixun Lin 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 191 KB

## Abstract Broersma and Hoede have introduced path graphs. Their characterization of __P__~3~‐graphs contains a flaw. This note presents the correct form of the characterization. © 1993 John Wiley & Sons, Inc.

The Pseudo-geometric Graphs for Generali

The Pseudo-geometric Graphs for Generalized Quadrangles of Order (3, t)

✍ Willem H. Haemers; Edward Spence 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 88 KB

The values t = 1, 3, 5, 6, 9 satisfy the standard necessary conditions for existence of a generalized quadrangle of order (3, t). This gives the following possible parameter sets for strongly regular graphs that are pseudo-geometric for such a generalized quadrangle: (v, k, λ, µ) = (16, 6, 2, 2), (4

A Geometric Characterization of the Simp

A Geometric Characterization of the Simple Group Co2

✍ T. Meixner 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 368 KB

Generating all 4-regular planar graphs f

Generating all 4-regular planar graphs from the graph of the octahedron

✍ Jenö Lehel 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 151 KB 👁 1 views

## Abstract It has been communicated by P. Manca in this journal that all 4‐regular connected planar graphs can be generated from the graph of the octahedron using simple planar graph operations. We point out an error in the generating procedure and correct it by including an additional operation.

A note on the characterization of domina

A note on the characterization of domination perfect graphs

✍ Jason Fulman 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 191 KB

## Abstract A graph __G__ is domination perfect if for each induced subgraph __H__ of __G__, γ(__H__) = __i__(__H__), where γ and __i__ are a graph's domination number and independent domination number, respectively. Zverovich and Zverovich [3] offered a finite forbidden induced characterization of

Separation and characterization of the v

Separation and characterization of the vinyl side chains from grafted polyacrylonitrile–cotton copolymers

✍ Nelle J. Morris; Florine A. Blouin; Jett C. Arthur Jr. 📂 Article 📅 1968 🏛 John Wiley and Sons 🌐 English ⚖ 424 KB