✦ LIBER ✦

On pitfalls in computing the geodetic number of a graph

✍ Scribed by Pierre Hansen; Nikolaj van Omme

Publisher: Springer-Verlag
Year: 2006
Tongue: English
Weight: 358 KB
Volume: 1
Category: Article
ISSN: 1862-4472
DOI: 10.1007/s11590-006-0032-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the geodetic number of a graph

✍ Gary Chartrand; Frank Harary; Ping Zhang 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 308 KB

The geodetic number of a graph

✍ Frank Harary; Emmanuel Loukakis; Constantine Tsouros 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 406 KB

Computing the binding number of a graph

✍ William H. Cunningham 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 189 KB

Computing the isoperimetric number of a

Computing the isoperimetric number of a graph

✍ P. A. Golovach 📂 Article 📅 1994 🏛 Springer US 🌐 English ⚖ 279 KB

On the bondage number of a graph

✍ Yue-Li Wang 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 162 KB

The bondage number b(G) of a graph G is the minimum cardinality of a set of edges of G whose removal from G makes the domination number of G increase. There are several papers discussed the upper bound of b(G). In this paper, we shall give an improved upper bound of b(G).

On the Cop Number of a Graph

✍ A. Berarducci; B. Intrigila 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 608 KB