𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On Strongly Regular Graphs withμ =  1

✍ Scribed by J. Deutsch; P.H. Fisher

Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
75 KB
Volume
22
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

✦ Synopsis

We consider strongly regular graphs in which each non-adjacent pair of vertices has exactly one common neighbour. These graphs give rise to partial linear spaces (one of which is a partial quadrangle) and a distance-regular graph of diameter three. The lower bound for the valency of the graph in terms of the number of common neighbours of two adjacent vertices is derived.

📜 SIMILAR VOLUMES

Hamilton-connectivity of 3-Domination Cr
Hamilton-connectivity of 3-Domination Critical Graphs with α = δ  +  2
✍ Yaojun Chen; Feng Tian; Yunqing Zhang 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 208 KB

A graph G is 3-domination critical if its domination number γ is 3 and the addition of any edge decreases γ by 1. It was proved by Favaron et al. that α ≤ δ + 2 for any connected 3-domination critical graph. Denote by τ (G) the toughness of a graph G. Recently Chen et al. conjectured that a connecte

On Extremal Permutations AvoidingωN&#xa0
On Extremal Permutations AvoidingωN = NN −  1 . . . 1
✍ J.-Y. Fourré; D. Krob; J.-C. Novelli 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 279 KB

Dedicated to the memory of Marcel-Paul Schützenberger Cet article présente une étude des permutations qui évitent le motif de la permutation maximale ω N = N N -1 . . . 1. Après avoir donné les définitions classiques, nous montrons que l'ensemble de ces permutations est un idéal pour l'ordre de Bruh

The Interlace Polynomial of Graphs at &#
The Interlace Polynomial of Graphs at  −  1
✍ P.N. Balister; B. Bollobás; J. Cutler; L. Pebody 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 168 KB

In this paper we give an explicit formula for the interlace polynomial at x = -1 for any graph, and as a result prove a conjecture of Arratia et al. that states that it is always of the form ±2 s . We also give a description of the graphs for which s is maximal.