𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Independence, irredundance, degrees and chromatic number in graphs

✍ Scribed by Gábor Bacsó; Odile Favaron

Book ID
108315813
Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
90 KB
Volume
259
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The irredundance number and maximum degr
The irredundance number and maximum degree of a graph
✍ B. Bollobás; E.J. Cockayne 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 104 KB

A vertex x in a subset X of vertices of an undirected graph is redundant if its dosed neighborhood is contained in the union of closed neighborhoods of vertices of X-{x}. In the context of a communications network, this means that any vertex that may receive communications from X may also be irdorme

Chordal graphs and upper irredundance, u
Chordal graphs and upper irredundance, upper domination and independence
✍ Michael S. Jacobson; Ken Peters 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 648 KB

In this paper we consider the following parameters: IR(G), the upper irredundance number, which is the order of the largest maximal irredundant set, I'(G), the upper domination number, which is the order of the largest minimal dominating set and /3(G), the independence number, which is the order of