An extremal problem for total domination stable graphs upon edge removal

Wyatt J. Desormeaux; Teresa W. Haynes; Michael A. Henning

doi:10.1016/j.dam.2011.01.025

An extremal problem for total domination stable graphs upon edge removal

Wyatt J. Desormeaux, Teresa W. Haynes, Michael A. Henning

Mathematics and Applied Mathematics

Research output: Contribution to journal › Article › peer-review

10 Citations (Scopus)

Abstract

A connected graph is total domination stable upon edge removal, if the removal of an arbitrary edge does not change the total domination number. We determine the minimum number of edges required for a total domination stable graph in terms of its order and total domination number.

Original language	English
Pages (from-to)	1048-1052
Number of pages	5
Journal	Discrete Applied Mathematics
Volume	159
Issue number	10
DOIs	https://doi.org/10.1016/j.dam.2011.01.025
Publication status	Published - 28 Jun 2011

Keywords

Edge removal stable
Extremal problem
Total domination

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics
Applied Mathematics

Access to Document

10.1016/j.dam.2011.01.025

Cite this

@article{bd7c0212712045ad9d5a30a377614435,

title = "An extremal problem for total domination stable graphs upon edge removal",

abstract = "A connected graph is total domination stable upon edge removal, if the removal of an arbitrary edge does not change the total domination number. We determine the minimum number of edges required for a total domination stable graph in terms of its order and total domination number.",

keywords = "Edge removal stable, Extremal problem, Total domination",

author = "Desormeaux, {Wyatt J.} and Haynes, {Teresa W.} and Henning, {Michael A.}",

year = "2011",

month = jun,

day = "28",

doi = "10.1016/j.dam.2011.01.025",

language = "English",

volume = "159",

pages = "1048--1052",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

publisher = "Elsevier B.V.",

number = "10",

}

TY - JOUR

T1 - An extremal problem for total domination stable graphs upon edge removal

AU - Desormeaux, Wyatt J.

AU - Haynes, Teresa W.

AU - Henning, Michael A.

PY - 2011/6/28

Y1 - 2011/6/28

N2 - A connected graph is total domination stable upon edge removal, if the removal of an arbitrary edge does not change the total domination number. We determine the minimum number of edges required for a total domination stable graph in terms of its order and total domination number.

AB - A connected graph is total domination stable upon edge removal, if the removal of an arbitrary edge does not change the total domination number. We determine the minimum number of edges required for a total domination stable graph in terms of its order and total domination number.

KW - Edge removal stable

KW - Extremal problem

KW - Total domination

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

U2 - 10.1016/j.dam.2011.01.025

DO - 10.1016/j.dam.2011.01.025

M3 - Article

AN - SCOPUS:79955485213

SN - 0166-218X

VL - 159

SP - 1048

EP - 1052

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

IS - 10

ER -

An extremal problem for total domination stable graphs upon edge removal

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this