✦ LIBER ✦

Bounding the number of circuits of a graph

✍ Scribed by Guoli Ding

Publisher: Springer-Verlag
Year: 1996
Tongue: English
Weight: 563 KB
Volume: 16
Category: Article
ISSN: 0209-9683
DOI: 10.1007/bf01261319

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the maximal number of independent cir

On the maximal number of independent circuits in a graph

✍ K. Corrádi; A. Hajnal 📂 Article 📅 1963 🏛 Akadmiai Kiad 🌐 English ⚖ 776 KB

On the maximal number of independent cir

On the maximal number of independent circuits in a graph

✍ G. Dirac; P. Erdõs 📂 Article 📅 1963 🏛 Akadmiai Kiad 🌐 English ⚖ 898 KB

On the number of certain Hamilton circui

On the number of certain Hamilton circuits of a complete graph

✍ G. Baróti 📂 Article 📅 1973 🏛 Springer Netherlands 🌐 English ⚖ 221 KB

Bounds for the covering number of a grap

Bounds for the covering number of a graph

✍ H.L. Abbott; A.C. Liu 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 333 KB

Bounds on the bondage number of a graph

✍ Bert L. Hartnell; Douglas F. Rall 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 317 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 results in a graph with domination number larger than that of G. Several new sharp upper bounds for b(G) are established. In addition, we present an infinite class of graphs each of whose bond

Bounds on the -domination number of a gr

Bounds on the -domination number of a graph

✍ Ermelinda DeLaViña; Wayne Goddard; Michael A. Henning; Ryan Pepper; Emil R. Vaug 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 200 KB

The k-domination number of a graph is the cardinality of a smallest set of vertices such that every vertex not in the set is adjacent to at least k vertices of the set. We prove two bounds on the k-domination number of a graph, inspired by two conjectures of the computer program Graffiti.pc. In part