✦ LIBER ✦

A note on dominated spaces

✍ Scribed by C. R. Borges

Publisher: Akadmiai Kiad
Year: 1991
Tongue: English
Weight: 205 KB
Volume: 58
Category: Article
ISSN: 1588-2632
DOI: 10.1007/bf01903541

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On compactly dominated spaces

✍ S. Deo; R. Krishan 📂 Article 📅 1986 🏛 Akadmiai Kiad 🌐 English ⚖ 483 KB

A note on total domination

✍ Robert B Allan; Renu Laskar; Stephen Hedetniemi 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 278 KB

For a graph G, let ~'(G), 3,z(G), i(G) and ir(G) denote the domination, total domination, independent domination and irredundance numbers of G, respectively. The following conjectures due to Robyn Dawes are proved: G)<~p and (ii) i(G)+ ~/z(G)~2. It is also shown that (iii) 3,t(G) ~<2ir(G) and (iv) 3

Dominated polynomials on(mathcal{L}_P )-

Dominated polynomials on(mathcal{L}_P )-spaces

✍ Geraldo Botelho; Daniel M. Pellegrino 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 101 KB

A Note on Spectrally Dominant Norms

✍ Angel Rodriguez Palacios 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 78 KB

A note on distance-dominating cycles

✍ P. Fraisse 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 396 KB

Nous prouvons une conjecture due & Bondy et Fan. Un cycle C d'un graphe G est dit m-dominant si tout sommet de V(G -C) est a distance au plus m de C. Notre r&t&at est: si G est k-connexe, et si G n'a pas de cycle m-dominant, alors il existe un stable de cardinal k + 1, dont les sommets sont deux 3 d

A note on r-dominating cliques

✍ Victor Chepoi 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 670 KB

Let M be a finite subset of vertices of a connected graph G and assume that every vertex v E M has a dominating radius r(v)E N U {0}. A complete subgraph C is an r-dominating clique of M if every vertex vEM is at distance at most r(v) from C. Even for r(v)~ 1 the problem whether or not a given graph