𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On Crown-Free Graphs with Regular μ-Subgraphs, II

✍ Scribed by V.V. Kabanov; A.A. Makhnev; D.V. Paduchikh

Book ID
111557774
Publisher
SP MAIK Nauka/Interperiodica
Year
2003
Tongue
English
Weight
172 KB
Volume
74
Category
Article
ISSN
0001-4346

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on bipartite subgraphs of triangl
A note on bipartite subgraphs of triangle-free regular graphs
✍ S. C. Locke 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 130 KB 👁 2 views

## Abstract Lower bounds on the size of a maximum bipartite subgraph of a triangle‐free __r__‐regular graph are presented.

Strongly Regular Square-free Graphs with
Strongly Regular Square-free Graphs with μ=2
✍ Benjamin V.C. Collins 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 277 KB

By a square in an undirected graph ⌫ , we mean a cycle x , y , z , w such that x is not adjacent to z and y is not adjacent to w . Suppose that ⌫ is a strongly regular graph with ϭ 2 , and assume that ⌫ does not contain a square . Pick any vertex x of ⌫ and let ⌫ Ј denote the induced subgraph on the

On Strongly Regular Graphs withμ =&
On Strongly Regular Graphs withμ =  1
✍ J. Deutsch; P.H. Fisher 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 75 KB

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 ter