✦ LIBER ✦

The Convexity Number of a Graph

✍ Scribed by Gary Chartrand; Curtiss E. Wall; Ping Zhang

Publisher: Springer Japan
Year: 2002
Tongue: English
Weight: 143 KB
Volume: 18
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s003730200014

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Some Remarks on the Convexity Number of

Some Remarks on the Convexity Number of a Graph

✍ John Gimbel 📂 Article 📅 2003 🏛 Springer Japan 🌐 English ⚖ 235 KB

A lower bound for the convexity number o

A lower bound for the convexity number of some graphs

✍ Byung Kee Kim 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 English ⚖ 135 KB

A heuristic for the stability number of

A heuristic for the stability number of a graph based on convex quadratic programming and tabu search

✍ L. Cavique; C. J. Luz 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 241 KB

The discipline number of a graph

✍ V. Chvátal; W. Cook 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 481 KB

The hull number of a graph

✍ Martin G Everett; Stephen B Seidman 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 379 KB

A set of points S of a graph is convex if any geodesic joining two points of S lies entirely within S. The convex hull of a set T of points is the smallest convex set that contains T. The hull number (h) of a graph is the cardinality of the smallest set of points whose convex hull is the entire grap

The bondage number of a graph

✍ John Frederick Fink; Michael S. Jacobson; Lael F. Kinch; John Roberts 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 654 KB