𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Domination in generalized Petersen graphs

✍ Scribed by Bohdan Zelinka

Book ID
110411000
Publisher
Springer
Year
2002
Tongue
English
Weight
92 KB
Volume
52
Category
Article
ISSN
0011-4642

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Generalized domination and efficient dom
Generalized domination and efficient domination in graphs
✍ D.W. Bange; A.E. Barkauskas; L.H. Host; P.J. Slater πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 516 KB

This paper generalizes dominating and efficient dominating sets of a graph. Let G be a graph with vertex set V(G). If f: V(G) ~ Y, where Y is a subset of the reals, the weight off is the sum of f(v) over all ve V(G). If the closed neighborhood sum off(v) at every vertex is at least 1, thenfis called

Which generalized petersen graphs are ca
Which generalized petersen graphs are cayley graphs?
✍ Roman Nedela; Martin Ε koviera πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 572 KB

## Abstract The generalized Petersen graph __GP__ (__n, k__), __n__ ≀ 3, 1 β‰₯ __k__ < __n__/2 is a cubic graph with vertex‐set {u~j~; i Ο΅ Z~n~} βˆͺ {v~j~; i Ο΅ Z~n~}, and edge‐set {u~i~u~i~, u~i~v~i~, v~i~v~i+k, iΟ΅~Z~n~}. In the paper we prove that (i) __GP__(__n, k__) is a Cayley graph if and only if

Generalized independence and domination
Generalized independence and domination in graphs
✍ MieczysΕ‚aw Borowiecki; Danuta Michalak πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 286 KB

The purpose of this paper is to introduce various concepts of g?-domination, which generalize and unify different well-known kinds of domination in graphs. We generalize a result of Lov/tsz concerning the existence of a partition of a set of vertices of G into independent subsets and a result of Fav