✦ LIBER ✦

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

✍ Scribed by Tung-Shan Fu; Tayuan Huang

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 377 KB
Volume: 15
Category: Article
ISSN: 0195-6698
DOI: 10.1006/eujc.1994.1040

No coin nor oath required. For personal study only.

✦ Synopsis

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 consequence, the Grassmann graphs and the bilinear forms graphs are characterized simultaneously among distance-regular graphs with classical parameters, together with some extra geometric conditions.

📜 SIMILAR VOLUMES

On a Characterization of Bilinear Forms

On a Characterization of Bilinear Forms Graphs

✍ K. Metsch 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 165 KB

We show that the bilinear forms graphs H q (n, d) of diameter d ≥ 3 are characterized as distanceregular graphs by their parameters provided that either n ≥ d + 3 and q ≥ 3, or n ≥ d + 4 and q = 2. As a corollary of the method used, we can show the following. If is a distance-regular graph with clas

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

A characterization of ?-outerplanar grap

A characterization of ?-outerplanar graphs

✍ Wargo, Lawrence 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 528 KB

Chartrand and Harary have shown that if G is a non-outerplanar graph such that, for every edge e, both the deletion G \ e and the contraction G/e of e from G are outerplanar, then G is isomorphic to K4 or K2,3. An a-outerplanar graph is a graph which is not outerplanar such that, for some edge a , b

Clustering analysis for graphs with mult

Clustering analysis for graphs with multiweighted edges: A unified approach to the threshold problem

✍ Goetschel, Roy 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 494 KB 👁 2 views

Multivalent relations, inferred as relationships with an added dimension of discernment, are realized as weighted graphs with multivalued edges. A unified treatment of the threshold problem is discussed and a reliability measure is produced to judge various partitions. 'R+ represents the non-negati

Optimal clustering in graphs with weight

Optimal clustering in graphs with weighted edges: A unified approach to the threshold problem

✍ Goetschel, Roy ;Voxman, William 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 691 KB

## Relations on a finite set V are viewed as weighted graphs. Using the language of graph theory two methods of partitioning V are examined. In one method, partitionings of V are obtained by selecting threshold values and applying them to a maximal weighted spanning forest. In another method a para