Planar domination graphs

被引：0
|
作者：
Eschen, EM
Klostermeyer, WF
Sritharan, R
机构：
[1] W Virginia Univ, Lane Dept Comp Sci & Elect Engn, Morgantown, WV 26506 USA
[2] Univ N Florida, Jacksonville, FL 32224 USA
[3] Univ Dayton, Dept Comp Sci, Dayton, OH 45469 USA
来源：
DISCRETE MATHEMATICS | 2003年 / 268卷 / 1-3期
关键词：
planar graph; weakly chordal graph; domination graph; recognition algorithm;
D O I：
10.1016/S0012-365X(02)00684-2
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
A graph G is a domination graph if each induced subgraph of G has a pair of vertices such that the open neighborhood of one is contained in the closed neighborhood of the other in the subgraph. No polynomial time algorithm or hardness result is known for the problem of deciding whether a graph is a domination graph. In this paper, it is shown that the class of planar domination graphs is equivalent to the class of planar weakly chordal graphs, and thus, can be recognized in polynomial time. (C) 2002 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：129 / 137
页数：9
相关论文
共 50 条
  • [21] Loop Zero Forcing and Grundy Domination in Planar Graphs and Claw-Free Cubic Graphs
    Domat, Alex
    Kuenzel, Kirsti
    BULLETIN OF THE MALAYSIAN MATHEMATICAL SCIENCES SOCIETY, 2024, 47 (04)
  • [22] SECURE DOMINATION IN 4-REGULAR PLANAR AND NON-PLANAR GRAPHS WITH GIRTH 3
    Parimelazhagan, R.
    Sulochana, V.
    Kumar, S. Vimal
    UTILITAS MATHEMATICA, 2018, 108 : 273 - 282
  • [23] On -Domination in Graphs
    Das, Angsuman
    Laskar, Renu C.
    Rad, Nader Jafari
    GRAPHS AND COMBINATORICS, 2018, 34 (01) : 193 - 205
  • [24] Generalized domination and efficient domination in graphs
    Bange, DW
    Barkauskas, AE
    Host, LH
    Slater, PJ
    DISCRETE MATHEMATICS, 1996, 159 (1-3) : 1 - 11
  • [25] DOMINATION AND INDEPENDENT DOMINATION NUMBERS OF GRAPHS
    SEIFTER, N
    ARS COMBINATORIA, 1994, 38 : 119 - 128
  • [26] Generalized domination and efficient domination in graphs
    Department of Mathematics, University of Wisconsin-LaCrosse, LaCrosse, WI 54601, United States
    不详
    Discrete Math, 1-3 (1-11):
  • [27] Domination versus disjunctive domination in graphs
    Henning, Michael A.
    Marcon, Sinclair A.
    QUAESTIONES MATHEMATICAE, 2016, 39 (02) : 261 - 273
  • [28] Graphs that are simultaneously efficient open domination and efficient closed domination graphs
    Klavzar, Sandi
    Peterin, Iztok
    Yero, Ismael G.
    DISCRETE APPLIED MATHEMATICS, 2017, 217 : 613 - 621
  • [29] Triangle-free projective-planar graphs with diameter two: Domination and characterization
    Chakraborty, Dibyayan
    Das, Sandip
    Mukherjee, Srijit
    Sahoo, Uma Kant
    Sen, Sagnik
    DISCRETE APPLIED MATHEMATICS, 2023, 331 : 11 - 24
  • [30] The signed (total) Roman domination problem on some classes of planar graphs - Convex polytopes
    Zec, Tatjana
    Matic, Dragan
    Djukanovic, Marko
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2024, 16 (08)
12345