Hierarchical networks of regular degree
โ Scribed by Stefan Boettcher; Bruno Goncalves
- Publisher
- Elsevier
- Year
- 2010
- Tongue
- English
- Weight
- 352 KB
- Volume
- 6
- Category
- Article
- ISSN
- 1875-3892
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
A p-factor of a graph G is a regular spanning subgraph of degree p . For G regular of degree d ( G ) and order 2n, let ( p l , ..., p,) be a partition of d ( G ) , so that p i > 0 ( I S i S r ) and p , i i pr = d(G). If H I . ..., H, are edge-disjoint regular spanning subgraphs of G of degrees p I ,
## Abstract In 1960, Dirac posed the conjecture that __r__โconnected 4โcritical graphs exist for every __r__ โฅ 3. In 1989, Erdลs conjectured that for every __r__ โฅ 3 there exist __r__โregular 4โcritical graphs. In this paper, a technique of constructing __r__โregular __r__โconnected vertexโtransiti