✦ LIBER ✦

Gallai-type theorems in domination and strong domination parameters

✍ Scribed by V. Swaminathan; P. Thangaraju

Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 70 KB
Volume: 15
Category: Article
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(04)00584-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Gallai-type theorems and domination para

Gallai-type theorems and domination parameters

✍ Gayla S. Domke; Jean E. Dunbar; Lisa R. Markus 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 598 KB

Strong weak domination and domination ba

Strong weak domination and domination balance in a graph

✍ E. Sampathkumar; L.Pushpa Latha 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 365 KB

Strong and Weak Domination, Full Sets an

Strong and Weak Domination, Full Sets and Domination Balance in Semigraphs

✍ S.S. Kamath; Saroja R. Hebbar 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 86 KB

Strong and weak domination in graphs

✍ V. Swaminathan; P. Thangaraju 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 168 KB

Point Set and Strong Point Set Dominatio

Point Set and Strong Point Set Domination in Graphs 1 Minimum spsd sets

✍ V. Swaminathan; R. Poovazhaki 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 218 KB

On equality in an upper bound for domina

On equality in an upper bound for domination parameters of graphs

✍ Favaron, O.; Mynhardt, C. M. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 141 KB 👁 2 views

We consider the well-known upper bounds µ(G) ≤ |V (G)|-∆(G), where ∆(G) denotes the maximum degree of G and µ(G) the irredundance, domination or independent domination numbers of G and give necessary and sufficient conditions for equality to hold in each case. We also describe specific classes of gr