𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Almost 2-Homogeneous Graphs and Completely Regular Quadrangles

✍ Scribed by Hiroshi Suzuki

Publisher
Springer Japan
Year
2008
Tongue
English
Weight
203 KB
Volume
24
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Almost regular edge colorings and regula
Almost regular edge colorings and regular decompositions of complete graphs
✍ Darryn Bryant; Barbara Maenhaut πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 127 KB

## Abstract For __k__ = 1 and __k__ = 2, we prove that the obvious necessary numerical conditions for packing __t__ pairwise edge‐disjoint __k__‐regular subgraphs of specified orders __m__~1~,__m__~2~,… ,__m__~t~ in the complete graph of order __n__ are also sufficient. To do so, we present an edge

Almost-regular factorization of graphs
Almost-regular factorization of graphs
✍ Jin Akiyama; Mikio Kano πŸ“‚ Article πŸ“… 1985 πŸ› John Wiley and Sons 🌐 English βš– 238 KB

For integers a and b, 0 s a s b, an [a,bl-graph G satisfies a s deg(x,G) s b for every vertex x of G, and an [a.bl-factor is a spanning subgraph its edges can be decomposed into [a,bl-factors. When both k and tare positive integers and s is a nonnegative integer, w e prove that every [(12k + 2)t +

Homogeneous Graphs and Regular Near Poly
Homogeneous Graphs and Regular Near Polygons
✍ K. Nomura πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 210 KB

We consider a distance-regular graph having homogeneous edge patterns in each entry of its intersection diagram with respect to an edge. We call such graphs homogeneous graphs. We study elementary properties of homogeneous graphs, and we show these graphs are related deeply with regular near polygon