Independent domination in outerplanar graphs

Wayne Goddard; Michael A. Henning

doi:10.1016/j.dam.2022.10.003

Independent domination in outerplanar graphs

Wayne Goddard, Michael A. Henning

Mathematics and Applied Mathematics

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

3 Citations (Scopus)

Abstract

In this paper we consider the maximum value of the independent domination number of outerplanar graphs. If one considers all outerplanar graphs or restricts to all maximal outerplanar graphs, this maximum is easy to find and known. So we focus on some subfamilies. Our main contribution is that, if one restricts to 2-connected outerplanar graphs of order n, then the maximum is (2n+1)/5, and there exists an infinite family of graphs that achieve this bound whenever 2n+1 is a multiple of 5.

Original language	English
Pages (from-to)	52-57
Number of pages	6
Journal	Discrete Applied Mathematics
Volume	325
DOIs	https://doi.org/10.1016/j.dam.2022.10.003
Publication status	Published - 30 Jan 2023

Keywords

Art-gallery
Independent domination
Outerplanar graph

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics
Applied Mathematics

Access to Document

10.1016/j.dam.2022.10.003

Cite this

@article{dd77350c32a347c0a244f4f83686d326,

title = "Independent domination in outerplanar graphs",

abstract = "In this paper we consider the maximum value of the independent domination number of outerplanar graphs. If one considers all outerplanar graphs or restricts to all maximal outerplanar graphs, this maximum is easy to find and known. So we focus on some subfamilies. Our main contribution is that, if one restricts to 2-connected outerplanar graphs of order n, then the maximum is (2n+1)/5, and there exists an infinite family of graphs that achieve this bound whenever 2n+1 is a multiple of 5.",

keywords = "Art-gallery, Independent domination, Outerplanar graph",

author = "Wayne Goddard and Henning, {Michael A.}",

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

year = "2023",

month = jan,

day = "30",

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

language = "English",

volume = "325",

pages = "52--57",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

publisher = "Elsevier",

}

TY - JOUR

T1 - Independent domination in outerplanar graphs

AU - Goddard, Wayne

AU - Henning, Michael A.

PY - 2023/1/30

Y1 - 2023/1/30

N2 - In this paper we consider the maximum value of the independent domination number of outerplanar graphs. If one considers all outerplanar graphs or restricts to all maximal outerplanar graphs, this maximum is easy to find and known. So we focus on some subfamilies. Our main contribution is that, if one restricts to 2-connected outerplanar graphs of order n, then the maximum is (2n+1)/5, and there exists an infinite family of graphs that achieve this bound whenever 2n+1 is a multiple of 5.

AB - In this paper we consider the maximum value of the independent domination number of outerplanar graphs. If one considers all outerplanar graphs or restricts to all maximal outerplanar graphs, this maximum is easy to find and known. So we focus on some subfamilies. Our main contribution is that, if one restricts to 2-connected outerplanar graphs of order n, then the maximum is (2n+1)/5, and there exists an infinite family of graphs that achieve this bound whenever 2n+1 is a multiple of 5.

KW - Art-gallery

KW - Independent domination

KW - Outerplanar graph

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

U2 - 10.1016/j.dam.2022.10.003

DO - 10.1016/j.dam.2022.10.003

M3 - Article

AN - SCOPUS:85141293121

SN - 0166-218X

VL - 325

SP - 52

EP - 57

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

ER -

Independent domination in outerplanar graphs

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this