We continue the recent study carried out by several authors on the cut sets in Cayley graphs with respect to quasiminimal generating sets. We improve the known results on these questions. The application of our main theorem to symmetric Cayley graphs on minimal generating sets leads to the followin
β¦ LIBER β¦
Skewness of Graphs with Small Cutsets
β Scribed by Graham Farr; Peter Eades
- Book ID
- 106047446
- Publisher
- Springer Japan
- Year
- 2003
- Tongue
- English
- Weight
- 169 KB
- Volume
- 19
- Category
- Article
- ISSN
- 0911-0119
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Small cutsets in quasiminimal Cayley gra
β
Y.O. Hamidoune; A.S. LladΓ³; O. Serra
π
Article
π
1996
π
Elsevier Science
π
English
β 586 KB
Coloring graphs with stable cutsets
β
Alan Tucker
π
Article
π
1983
π
Elsevier Science
π
English
β 537 KB
Color-critical graphs with independent c
β
S. M. Gyulumyan
π
Article
π
1987
π
Springer US
π
English
β 581 KB
Vertex cutsets of undirected graphs
β
Patvardhan, C.; Prasad, V.C.; Pyara, V.P.
π
Article
π
1995
π
IEEE
π
English
β 617 KB
Kernels in graphs with a clique-cutset
β
Henry Jacob
π
Article
π
1996
π
Elsevier Science
π
English
β 138 KB
We consider graphs that have a clique-cutset, and we show that this property preserves the existence of a kernel in a certain sense. We consider finite directed graphs that do not have multiple arcs or loops, but there may be symmetric arcs between some pairs of vertices. Let G = (V, A) be a direct
Skewness of generalized Petersen graphs
β
Gek Ling Chia; Chan Lye Lee
π
Article
π
2012
π
Higher Education Press and Springer
π
English
β 145 KB