A note on the domination dot-critical graphs

Xue gang Chen; Wai Chee Shiu

doi:10.1016/j.dam.2009.07.014

A note on the domination dot-critical graphs

Xue gang Chen^*, Wai Chee Shiu

^*Corresponding author for this work

Department of Mathematics

Research output: Contribution to journal › Journal article › peer-review

4 Citations (Scopus)

Abstract

A graph G is dot-critical if contracting any edge decreases the domination number. Nader Jafari Rad (2009) [3] posed the problem: Is it true that a connected k-dot-critical graph G with G^′ = 0{combining long solidus overlay} is 2-connected? In this note, we give a family of 1-connected 2 k-dot-critical graph with G^′ = 0{combining long solidus overlay} and show that this problem has a negative answer.

Original language	English
Pages (from-to)	3743-3745
Number of pages	3
Journal	Discrete Applied Mathematics
Volume	157
Issue number	18
DOIs	https://doi.org/10.1016/j.dam.2009.07.014
Publication status	Published - 28 Nov 2009

User-Defined Keywords

Complete bipartite graph
Domination dot-critical
Domination number

Access to Document

10.1016/j.dam.2009.07.014

Cite this

@article{52e022ab1637486fb4a62de7f654088b,

title = "A note on the domination dot-critical graphs",

abstract = "A graph G is dot-critical if contracting any edge decreases the domination number. Nader Jafari Rad (2009) [3] posed the problem: Is it true that a connected k-dot-critical graph G with G′ = 0{combining long solidus overlay} is 2-connected? In this note, we give a family of 1-connected 2 k-dot-critical graph with G′ = 0{combining long solidus overlay} and show that this problem has a negative answer.",

keywords = "Complete bipartite graph, Domination dot-critical, Domination number",

author = "Chen, {Xue gang} and Shiu, {Wai Chee}",

note = "Funding Information: This work is supported by GRF, Research Grant Council of Hong Kong; FRG, Hong Kong Baptist University. ",

year = "2009",

month = nov,

day = "28",

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

language = "English",

volume = "157",

pages = "3743--3745",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

publisher = "Elsevier B.V.",

number = "18",

}

TY - JOUR

T1 - A note on the domination dot-critical graphs

AU - Chen, Xue gang

AU - Shiu, Wai Chee

N1 - Funding Information: This work is supported by GRF, Research Grant Council of Hong Kong; FRG, Hong Kong Baptist University.

PY - 2009/11/28

Y1 - 2009/11/28

N2 - A graph G is dot-critical if contracting any edge decreases the domination number. Nader Jafari Rad (2009) [3] posed the problem: Is it true that a connected k-dot-critical graph G with G′ = 0{combining long solidus overlay} is 2-connected? In this note, we give a family of 1-connected 2 k-dot-critical graph with G′ = 0{combining long solidus overlay} and show that this problem has a negative answer.

AB - A graph G is dot-critical if contracting any edge decreases the domination number. Nader Jafari Rad (2009) [3] posed the problem: Is it true that a connected k-dot-critical graph G with G′ = 0{combining long solidus overlay} is 2-connected? In this note, we give a family of 1-connected 2 k-dot-critical graph with G′ = 0{combining long solidus overlay} and show that this problem has a negative answer.

KW - Complete bipartite graph

KW - Domination dot-critical

KW - Domination number

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

U2 - 10.1016/j.dam.2009.07.014

DO - 10.1016/j.dam.2009.07.014

M3 - Journal article

AN - SCOPUS:70350573934

SN - 0166-218X

VL - 157

SP - 3743

EP - 3745

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

IS - 18

ER -

A note on the domination dot-critical graphs

Abstract

User-Defined Keywords

Access to Document

Other files and links

Fingerprint

Cite this