✦ LIBER ✦

On eliminating vertices from a tree

✍ Scribed by I.Douglas Moon

Book ID: 103695852
Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 391 KB
Volume: 15
Category: Article
ISSN: 0305-0548
DOI: 10.1016/0305-0548(88)90036-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Spanning Tree with High Degree Vertice

A Spanning Tree with High Degree Vertices

✍ Kenta Ozeki; Tomoki Yamashita 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 116 KB

A Note on the Column Elimination Tree

✍ Gilbert, John R.; Grigori, Laura 📂 Article 📅 2003 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 176 KB

Path coverings of the vertices of a tree

✍ Peter J. Slater 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 840 KB

Consider a collection of disjoint paths in graph G such that every vertex is on one of these paths. The size of the smallest such collection is denoted i(G). A procedure for forming such collections is established. Restricting attention to trees, the range of values for the sizes of the collections

On constructing the elimination tree

✍ Yunzhou Zhu; David Mutchler 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 348 KB

On the maximal energy tree with two maxi

On the maximal energy tree with two maximum degree vertices

✍ Jing Li; Xueliang Li; Yongtang Shi 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 264 KB

Vertices contained in every minimum domi

Vertices contained in every minimum dominating set of a tree

✍ Mynhardt, C. M. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 321 KB

In this article we begin the study of the vertex subsets of a graph G which consist of the vertices contained in all, or in no, respectively, minimum dominating sets of G. We characterize these sets for trees, and also obtain results on the vertices contained in all minimum independent dominating se