机构:
Clemson Univ, Sch Math & Stat Sci, Clemson, SC 29631 USA
Univ Johannesburg, Dept Math & Appl Math, Johannesburg, South AfricaClemson Univ, Sch Math & Stat Sci, Clemson, SC 29631 USA
Goddard, Wayne
[1
,2
]
Henning, Michael A.
论文数: 0引用数: 0
h-index: 0
机构:
Univ Johannesburg, Dept Math & Appl Math, Johannesburg, South AfricaClemson Univ, Sch Math & Stat Sci, Clemson, SC 29631 USA
Henning, Michael A.
[2
]
机构:
[1] Clemson Univ, Sch Math & Stat Sci, Clemson, SC 29631 USA
[2] Univ Johannesburg, Dept Math & Appl Math, Johannesburg, South Africa
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.(c) 2022 Elsevier B.V. All rights reserved.
机构:
Department of Mathematical Sciences, Yazd University, Yazd,89195-741, IranDepartment of Mathematical Sciences, Yazd University, Yazd,89195-741, Iran
Alikhani, Saeid
Mehraban, Mazharodin
论文数: 0引用数: 0
h-index: 0
机构:
Department of Mathematical Sciences, Yazd University, Yazd,89195-741, IranDepartment of Mathematical Sciences, Yazd University, Yazd,89195-741, Iran
Mehraban, Mazharodin
Zakharov, Alexei
论文数: 0引用数: 0
h-index: 0
机构:
Novosibirsk State University, Pirogova str. 2, Novosibirsk,630090, Russia
Sobolev Institute of Mathematics, Ak. Koptyug av. 4, Novosibirsk,630090, RussiaDepartment of Mathematical Sciences, Yazd University, Yazd,89195-741, Iran
Zakharov, Alexei
Golmohammadi, Hamidreza R.
论文数: 0引用数: 0
h-index: 0
机构:
Novosibirsk State University, Pirogova str. 2, Novosibirsk,630090, Russia
Sobolev Institute of Mathematics, Ak. Koptyug av. 4, Novosibirsk,630090, RussiaDepartment of Mathematical Sciences, Yazd University, Yazd,89195-741, Iran