✦ LIBER ✦

On the degree of dominator trees

✍ Scribed by Ernst L. Leiss

Book ID: 113163190
Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 151 KB
Volume: 29
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(88)90060-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Irredundance, secure domination and maxi

Irredundance, secure domination and maximum degree in trees

✍ E.J. Cockayne 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 148 KB

Packing Trees with Constraints on the Le

Packing Trees with Constraints on the Leaf Degree

✍ Jácint Szabó 📂 Article 📅 2008 🏛 Springer Japan 🌐 English ⚖ 206 KB

Representing Trees of Higher Degree

✍ David Benoit; Erik D. Demaine; J. Ian Munro; Rajeev Raman; Venkatesh Raman; S. S 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 225 KB

Total domination in partitioned trees an

Total domination in partitioned trees and partitioned graphs with minimum degree two

✍ Allan Frendrup; Michael A. Henning; Preben Dahl Vestergaard 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 266 KB

The degree profile of random Pólya trees

✍ Bernhard Gittenberger; Veronika Kraus 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 391 KB

The achromatic number of bounded degree

The achromatic number of bounded degree trees

✍ Niall Cairnie; Keith Edwards 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 621 KB

The achromatic number ~b(G) of a simple graph G is the largest number of colours possible in a proper vertex colouring of G in which each pair of coiours appears on at least one edge. The problem of determining the achromatic number of a tree is known to be NP-hard (Cairnie and Edwards, 1997). In t