✦ LIBER ✦

Rank-determining sets of metric graphs

✍ Scribed by Ye Luo

Book ID: 108167342
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 302 KB
Volume: 118
Category: Article
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2011.03.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Metric Dimension andR-Sets of Connected

Metric Dimension andR-Sets of Connected Graphs

✍ Ioan Tomescu; Muhammad Imran 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 170 KB

Zero forcing sets and the minimum rank o

Zero forcing sets and the minimum rank of graphs

✍ AIM Minimum Rank – Special Graphs Work Group 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 236 KB

On minimum rank and zero forcing sets of

On minimum rank and zero forcing sets of a graph

✍ Liang-Hao Huang; Gerard J. Chang; Hong-Gwa Yeh 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 217 KB

Rankings of Graphs

✍ Bodlaender, Hans L.; Deogun, Jitender S.; Jansen, Klaus; Kloks, Ton; Kratsch, Di 📂 Article 📅 1998 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 305 KB

On the geodetic number and related metri

On the geodetic number and related metric sets in Cartesian product graphs

✍ Boštjan Brešar; Sandi Klavžar; Aleksandra Tepeh Horvat 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 290 KB

Stability critical graphs and ranks face

Stability critical graphs and ranks facets of the stable set polytope

✍ E.C. Sewell; L.E. Trotter Jr. 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 616 KB

Rank inequalities due to stability critical (u-critical) graphs are used to develop a finite nested sequence of linear relaxations of the stable set polytope, the strongest of which provides an integral max-min relation: In a simple graph, the maximum size of a stable set is equal to the minimum (we