A note on the k-degree Cayley graph
β Scribed by Yuuki Tanaka; Yukio Shibata
- Publisher
- John Wiley and Sons
- Year
- 2009
- Tongue
- English
- Weight
- 69 KB
- Volume
- 54
- Category
- Article
- ISSN
- 0028-3045
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The aim of this note is to present a short proof of a result of Nedela and S8 koviera (J. Graph Theory 19 (1995, 1 11)) concerning those generalized Petersen graphs that are also Cayley graphs. In that paper the authors chose the heavy weaponry of regular maps on closed connected orientable surfaces
## dedicated to professor w. t. tutte on the occasion of his eightieth birtday It is known that the chromatic number of a graph G=(V, E) with V= [1, 2, ..., n] exceeds k iff the graph polynomial f G => ij # E, i<j (x i &x j ) lies in certain ideals. We describe a short proof of this result, using
## Abstract A subset __S__ of vertices of a graph __G__ is __k__βdominating if every vertex not in __S__ has at least __k__ neighbors in __S__. The __k__βdomination number $\gamma\_k(G)$ is the minimum cardinality of a __k__βdominating set of __G__. Different upper bounds on $\gamma\_{k}(G)$ are kn