A linear vizing-like relation relating the size and total domination number of a graph

Michael A. Henning

doi:10.1002/jgt.20082

A linear vizing-like relation relating the size and total domination number of a graph

Michael A. Henning

University of KwaZulu-Natal

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

12 Citations (Scopus)

Abstract

We prove that m ≤ Δ(n - γt) for every graph each component of which has order at least 3 of order n, size m, total domination number γt, and maximum degree Δ ≥ 3.

Original language	English
Pages (from-to)	285-290
Number of pages	6
Journal	Journal of Graph Theory
Volume	49
Issue number	4
DOIs	https://doi.org/10.1002/jgt.20082
Publication status	Published - Aug 2005
Externally published	Yes

Keywords

Maximum degree
Order; size
Total domination

ASJC Scopus subject areas

Geometry and Topology

Access to Document

10.1002/jgt.20082

Cite this

@article{9e2cd33885d240e0a589e203a9097325,

title = "A linear vizing-like relation relating the size and total domination number of a graph",

abstract = "We prove that m ≤ Δ(n - γt) for every graph each component of which has order at least 3 of order n, size m, total domination number γt, and maximum degree Δ ≥ 3.",

keywords = "Maximum degree, Order; size, Total domination",

author = "Henning, {Michael A.}",

year = "2005",

month = aug,

doi = "10.1002/jgt.20082",

language = "English",

volume = "49",

pages = "285--290",

journal = "Journal of Graph Theory",

issn = "0364-9024",

publisher = "Wiley-Liss Inc.",

number = "4",

}

TY - JOUR

T1 - A linear vizing-like relation relating the size and total domination number of a graph

AU - Henning, Michael A.

PY - 2005/8

Y1 - 2005/8

N2 - We prove that m ≤ Δ(n - γt) for every graph each component of which has order at least 3 of order n, size m, total domination number γt, and maximum degree Δ ≥ 3.

AB - We prove that m ≤ Δ(n - γt) for every graph each component of which has order at least 3 of order n, size m, total domination number γt, and maximum degree Δ ≥ 3.

KW - Maximum degree

KW - Order; size

KW - Total domination

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

U2 - 10.1002/jgt.20082

DO - 10.1002/jgt.20082

M3 - Article

AN - SCOPUS:24144452415

SN - 0364-9024

VL - 49

SP - 285

EP - 290

JO - Journal of Graph Theory

JF - Journal of Graph Theory

IS - 4

ER -

A linear vizing-like relation relating the size and total domination number of a graph

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this