New upper bounds for the bondage number of a graph in terms of its maximum degree and euler characteristic

Jia Huang, Jian Shen

Research output: Contribution to journalArticle

Abstract

The bondage number 6(G) of a graph G is the smallest number of edges whose removal from G results in a graph with larger domination number. Let G be embeddable on a surface whose Euler characteristic χ is as large as possible, and assume χ < 0. Gagarin-Zverovich and Huang have recently found upper bounds of 6(G) in terms of the maximum degree Δ(G) and the Euler characteristic x-In this paper we prove a better upper bound 6(G) ≤ Δ(G) + [t] where t is the largest real root of the cubic equation z3 + z2 + (3χ -8)z + 9x - 12 = 0; this upper bound is asymptotically equivalent to 6(G) ≤ A(G) + 1. We also establish further improved upper bounds for 6(G) when the girth, order, or size of the graph G is large compared with |χ|.

Original languageEnglish (US)
Pages (from-to)373-387
Number of pages15
JournalArs Combinatoria
Volume140
StatePublished - Jul 2018

Fingerprint

Bondage number
Euler Characteristic
Maximum Degree
Upper bound
Graph in graph theory
Cubic equation
Real Roots
Asymptotically equivalent
Domination number
Girth

Keywords

  • Bondage number
  • Euler characteristic
  • Euler's formula
  • Genus
  • Girth
  • Graph embedding
  • Order
  • Size

ASJC Scopus subject areas

  • Mathematics(all)

Cite this

New upper bounds for the bondage number of a graph in terms of its maximum degree and euler characteristic. / Huang, Jia; Shen, Jian.

In: Ars Combinatoria, Vol. 140, 07.2018, p. 373-387.

Research output: Contribution to journalArticle

@article{d7b1aff07f6945729732ff327c0985c2,
title = "New upper bounds for the bondage number of a graph in terms of its maximum degree and euler characteristic",
abstract = "The bondage number 6(G) of a graph G is the smallest number of edges whose removal from G results in a graph with larger domination number. Let G be embeddable on a surface whose Euler characteristic χ is as large as possible, and assume χ < 0. Gagarin-Zverovich and Huang have recently found upper bounds of 6(G) in terms of the maximum degree Δ(G) and the Euler characteristic x-In this paper we prove a better upper bound 6(G) ≤ Δ(G) + [t] where t is the largest real root of the cubic equation z3 + z2 + (3χ -8)z + 9x - 12 = 0; this upper bound is asymptotically equivalent to 6(G) ≤ A(G) + 1. We also establish further improved upper bounds for 6(G) when the girth, order, or size of the graph G is large compared with |χ|.",
keywords = "Bondage number, Euler characteristic, Euler's formula, Genus, Girth, Graph embedding, Order, Size",
author = "Jia Huang and Jian Shen",
year = "2018",
month = "7",
language = "English (US)",
volume = "140",
pages = "373--387",
journal = "Ars Combinatoria",
issn = "0381-7032",
publisher = "Charles Babbage Research Centre",

}

TY - JOUR

T1 - New upper bounds for the bondage number of a graph in terms of its maximum degree and euler characteristic

AU - Huang, Jia

AU - Shen, Jian

PY - 2018/7

Y1 - 2018/7

N2 - The bondage number 6(G) of a graph G is the smallest number of edges whose removal from G results in a graph with larger domination number. Let G be embeddable on a surface whose Euler characteristic χ is as large as possible, and assume χ < 0. Gagarin-Zverovich and Huang have recently found upper bounds of 6(G) in terms of the maximum degree Δ(G) and the Euler characteristic x-In this paper we prove a better upper bound 6(G) ≤ Δ(G) + [t] where t is the largest real root of the cubic equation z3 + z2 + (3χ -8)z + 9x - 12 = 0; this upper bound is asymptotically equivalent to 6(G) ≤ A(G) + 1. We also establish further improved upper bounds for 6(G) when the girth, order, or size of the graph G is large compared with |χ|.

AB - The bondage number 6(G) of a graph G is the smallest number of edges whose removal from G results in a graph with larger domination number. Let G be embeddable on a surface whose Euler characteristic χ is as large as possible, and assume χ < 0. Gagarin-Zverovich and Huang have recently found upper bounds of 6(G) in terms of the maximum degree Δ(G) and the Euler characteristic x-In this paper we prove a better upper bound 6(G) ≤ Δ(G) + [t] where t is the largest real root of the cubic equation z3 + z2 + (3χ -8)z + 9x - 12 = 0; this upper bound is asymptotically equivalent to 6(G) ≤ A(G) + 1. We also establish further improved upper bounds for 6(G) when the girth, order, or size of the graph G is large compared with |χ|.

KW - Bondage number

KW - Euler characteristic

KW - Euler's formula

KW - Genus

KW - Girth

KW - Graph embedding

KW - Order

KW - Size

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

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

M3 - Article

AN - SCOPUS:85051478895

VL - 140

SP - 373

EP - 387

JO - Ars Combinatoria

JF - Ars Combinatoria

SN - 0381-7032

ER -