✦ LIBER ✦

A characterization of Grassmann and Johnson graphs

✍ Scribed by Minoru Numata

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 845 KB
Volume: 48
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(90)90116-h

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A characterization of Grassmann graphs

✍ Klaus Metsch 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 324 KB

A Unified Approach to a Characterization

A Unified Approach to a Characterization of Grassmann Graphs and Bilinear Forms Graphs

✍ Tung-Shan Fu; Tayuan Huang 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 377 KB

Wilbrink and Brouwer [18] proved that certain semi-partial geometries with some weak restrictions on parameters satisfy the dual of Pasch's axiom. Inspired by their work, a class of incidence structures associated with distance-regular graphs with classical parameters is studied in this paper. As a

Characterization of the Folded Johnson G

Characterization of the Folded Johnson Graphs of Small Diameter by their Intersection Arrays

✍ Klaus Metsch 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 221 KB

It is known that the folded Johnson graphs J (2m, m) with m ≥ 16 are uniquely determined as distance regular graphs by their intersection array. We show that the same holds for m ≥ 6.

A Characterization of Grassmann Spaces o

A Characterization of Grassmann Spaces of Index h of a Projective Space

✍ Eva Ferrara Dentice 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 186 KB

A characterization of Seymour graphs

✍ Ageev, A. A.; Kostochka, A. V.; Szigeti, Z. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 105 KB 👁 1 views

A connected undirected graph G is called a Seymour graph if the maximum number of edge disjoint T -cuts is equal to the cardinality of a minimum T -join for every even subset T of V (G). Several families of graphs have been shown to be subfamilies of Seymour graphs (Seymour

A characterization of ptolemaic graphs

✍ Edward Howorka 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 466 KB

A connected graph G is ptolernaic provided that for each four vertices u,, 1 5 i 5 4, of G, the six distances d, =dG (u,ui), i f j satisfy the inequality d,2d34 5 d,3d24 + d,4d23 (shown by Ptolemy t o hold in Euclidean spaces). Ptolemaic graphs were first investigated by Chartrand and Kay, who showe