Isolation number of maximal outerplanar graphs

Journal article

Authors/Editors

Strategic Research Themes

No matching items found.

Publication Details

Author list: Tokunaga S.-I., Jiarasuksakun T., Kaemawichanurat P.

Publisher: Elsevier B.V.

Publication year: 2019

Volume number: 267

Start page: 215

End page: 218

Number of pages: 4

ISSN: 0166-218X

eISSN: 0166-218X

URL: https://www.scopus.com/inward/record.uri?eid=2-s2.0-85069573235&doi=10.1016%2fj.dam.2019.06.011&partnerID=40&md5=3945f22735364bb42a4f3456dce31bdd

Languages: English-Great Britain (EN-GB)

View in Web of Science | View on publisher site | View citing articles in Web of Science

Abstract

A subset S of vertices in a graph G is called an isolating set if V(G)∖NG[S] is an independent set of G. The isolation number ι(G) is the minimum cardinality of an isolating set of G. Let G be a maximal outerplanar graph of order n with n2 vertices of degree 2. It was previously proved that [Formula presented]. In this paper, we improve this bound to be [Formula presented] and these bounds are best possible. © 2019 Elsevier B.V.

Keywords

Isolation number, Partial-domination