The bondage numbers of graphs with small crossing numbers

Jia Huang, Jun Ming Xu

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

The bondage number b (G) of a nonempty graph G is the cardinality of a smallest edge set whose removal from G results in a graph with domination number greater than the domination number γ (G) of G. Kang and Yuan proved b (G) ≤ 8 for every connected planar graph G. Fischermann, Rautenbach and Volkmann obtained some further results for connected planar graphs. In this paper, we generalize their results to connected graphs with small crossing numbers.

Original languageEnglish (US)
Pages (from-to)1881-1897
Number of pages17
JournalDiscrete Mathematics
Volume307
Issue number15
DOIs
StatePublished - Jul 6 2007

Fingerprint

Bondage number
Crossing number
Connected graph
Domination number
Planar graph
Graph in graph theory
Cardinality
Generalise

Keywords

  • Bondage number
  • Crossing number
  • Domination number
  • Planar graph

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Cite this

The bondage numbers of graphs with small crossing numbers. / Huang, Jia; Xu, Jun Ming.

In: Discrete Mathematics, Vol. 307, No. 15, 06.07.2007, p. 1881-1897.

Research output: Contribution to journalArticle

Huang, Jia ; Xu, Jun Ming. / The bondage numbers of graphs with small crossing numbers. In: Discrete Mathematics. 2007 ; Vol. 307, No. 15. pp. 1881-1897.
@article{4ffd3d01fe034ef3ba7f6060c7ed5ee6,
title = "The bondage numbers of graphs with small crossing numbers",
abstract = "The bondage number b (G) of a nonempty graph G is the cardinality of a smallest edge set whose removal from G results in a graph with domination number greater than the domination number γ (G) of G. Kang and Yuan proved b (G) ≤ 8 for every connected planar graph G. Fischermann, Rautenbach and Volkmann obtained some further results for connected planar graphs. In this paper, we generalize their results to connected graphs with small crossing numbers.",
keywords = "Bondage number, Crossing number, Domination number, Planar graph",
author = "Jia Huang and Xu, {Jun Ming}",
year = "2007",
month = "7",
day = "6",
doi = "10.1016/j.disc.2006.09.035",
language = "English (US)",
volume = "307",
pages = "1881--1897",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "15",

}

TY - JOUR

T1 - The bondage numbers of graphs with small crossing numbers

AU - Huang, Jia

AU - Xu, Jun Ming

PY - 2007/7/6

Y1 - 2007/7/6

N2 - The bondage number b (G) of a nonempty graph G is the cardinality of a smallest edge set whose removal from G results in a graph with domination number greater than the domination number γ (G) of G. Kang and Yuan proved b (G) ≤ 8 for every connected planar graph G. Fischermann, Rautenbach and Volkmann obtained some further results for connected planar graphs. In this paper, we generalize their results to connected graphs with small crossing numbers.

AB - The bondage number b (G) of a nonempty graph G is the cardinality of a smallest edge set whose removal from G results in a graph with domination number greater than the domination number γ (G) of G. Kang and Yuan proved b (G) ≤ 8 for every connected planar graph G. Fischermann, Rautenbach and Volkmann obtained some further results for connected planar graphs. In this paper, we generalize their results to connected graphs with small crossing numbers.

KW - Bondage number

KW - Crossing number

KW - Domination number

KW - Planar graph

UR - http://www.scopus.com/inward/record.url?scp=34247092920&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34247092920&partnerID=8YFLogxK

U2 - 10.1016/j.disc.2006.09.035

DO - 10.1016/j.disc.2006.09.035

M3 - Article

AN - SCOPUS:34247092920

VL - 307

SP - 1881

EP - 1897

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 15

ER -