✦ LIBER ✦

An improved upper bound for the bondage number of graphs on surfaces

✍ Scribed by Jia Huang

Book ID: 113567699
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 209 KB
Volume: 312
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2012.05.012

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Improving an Upper Bound on the Stabilit

Improving an Upper Bound on the Stability Number of a Graph

✍ Carlos J. Luz 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 494 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

An Improved Upper Bound on the Total Res

An Improved Upper Bound on the Total Restrained Domination Number in Cubic Graphs

✍ Justin Southey, Michael A. Henning 📂 Article 📅 2011 🏛 Springer Japan 🌐 English ⚖ 203 KB

An Upper Bound for the Clar Number of Fu

An Upper Bound for the Clar Number of Fullerene Graphs

✍ Heping Zhang; Dong Ye 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 337 KB

An Improved Upper Bound for the Finite D

An Improved Upper Bound for the Finite Delay of Graphs

✍ Vilfan, B. 📂 Article 📅 1970 🏛 IEEE 🌐 English ⚖ 804 KB

An upper bound for the path number of a

An upper bound for the path number of a graph

✍ Alan Donald 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 529 KB

## Abstract The path number of a graph __G__, denoted __p(G)__, is the minimum number of edge‐disjoint paths covering the edges of __G.__ Lovász has proved that if __G__ has __u__ odd vertices and __g__ even vertices, then __p(G)__ ≤ 1/2 __u__ + __g__ ‐ 1 ≤ __n__ ‐ 1, where __n__ is the total numbe