On (1,2)-domination in cubic graphs

M. H. Fakharan; A. A. Gorzin; Michael A. Henning; A. Jafari; R. Touserkani

doi:10.1016/j.disc.2021.112546

On (1,2)-domination in cubic graphs

M. H. Fakharan, A. A. Gorzin, Michael A. Henning, A. Jafari, R. Touserkani

Mathematics and Applied Mathematics

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

Abstract

A (1,2)-dominating set in a graph G with minimum degree at least 2 is a set S of vertices of G such that every vertex in V(G)∖S has at least one neighbor in S and every vertex in S has at least two neighbors in S. The (1,2)-domination number, γ_1,2(G), of G is the minimum cardinality of a (1,2)-dominating set of G. In this paper we prove that if G is a cubic graph of order n, then [Formula presented], and this bound is tight.

Original language	English
Article number	112546
Journal	Discrete Mathematics
Volume	344
Issue number	10
DOIs	https://doi.org/10.1016/j.disc.2021.112546
Publication status	Published - Oct 2021

Keywords

(r,s)-domination
Cubic graph
Domination

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1016/j.disc.2021.112546

Cite this

@article{c8d41578dca541f594e74627d42c277d,

title = "On (1,2)-domination in cubic graphs",

abstract = "A (1,2)-dominating set in a graph G with minimum degree at least 2 is a set S of vertices of G such that every vertex in V(G)∖S has at least one neighbor in S and every vertex in S has at least two neighbors in S. The (1,2)-domination number, γ1,2(G), of G is the minimum cardinality of a (1,2)-dominating set of G. In this paper we prove that if G is a cubic graph of order n, then [Formula presented], and this bound is tight.",

keywords = "(r,s)-domination, Cubic graph, Domination",

author = "Fakharan, {M. H.} and Gorzin, {A. A.} and Henning, {Michael A.} and A. Jafari and R. Touserkani",

note = "Publisher Copyright: {\textcopyright} 2021 Elsevier B.V.",

year = "2021",

month = oct,

doi = "10.1016/j.disc.2021.112546",

language = "English",

volume = "344",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "10",

}

TY - JOUR

T1 - On (1,2)-domination in cubic graphs

AU - Fakharan, M. H.

AU - Gorzin, A. A.

AU - Henning, Michael A.

AU - Jafari, A.

AU - Touserkani, R.

PY - 2021/10

Y1 - 2021/10

N2 - A (1,2)-dominating set in a graph G with minimum degree at least 2 is a set S of vertices of G such that every vertex in V(G)∖S has at least one neighbor in S and every vertex in S has at least two neighbors in S. The (1,2)-domination number, γ1,2(G), of G is the minimum cardinality of a (1,2)-dominating set of G. In this paper we prove that if G is a cubic graph of order n, then [Formula presented], and this bound is tight.

AB - A (1,2)-dominating set in a graph G with minimum degree at least 2 is a set S of vertices of G such that every vertex in V(G)∖S has at least one neighbor in S and every vertex in S has at least two neighbors in S. The (1,2)-domination number, γ1,2(G), of G is the minimum cardinality of a (1,2)-dominating set of G. In this paper we prove that if G is a cubic graph of order n, then [Formula presented], and this bound is tight.

KW - (r,s)-domination

KW - Cubic graph

KW - Domination

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

U2 - 10.1016/j.disc.2021.112546

DO - 10.1016/j.disc.2021.112546

M3 - Article

AN - SCOPUS:85110209577

SN - 0012-365X

VL - 344

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 10

M1 - 112546

ER -

On (1,2)-domination in cubic graphs

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this