Outer-connected domination in 2-connected cubic graphs

被引：1
|
作者：
Wang, Shipeng [1 ]
Wu, Baoyindureng [1 ]
An, Xinhui [1 ]
Liu, Xiaoping [2 ]
Deng, Xingchao [3 ]
机构：
[1] Xinjiang Univ, Coll Math & Syst Sci, Urumqi 830046, Xinjiang, Peoples R China
[2] Xinjiang Inst Engn, Fdn Dept, Urumqi 830000, Xinjiang, Peoples R China
[3] LPMC TJKLC Nankai Univ, Ctr Combinator, Tianjin 300071, Peoples R China
来源：
DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS | 2014年 / 6卷 / 03期
关键词：
Domination number; outer-connected domination number; cubic graphs;
D O I：
10.1142/S1793830914500323
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
A set S of vertices of a graph G is an outer-connected dominating set if every vertex not in S is adjacent to some vertex in S and the subgraph induced by V\S is connected. The outer-connected domination number gamma(c)(G) is the minimum size of such a set. We present an infinite family of 2-connected cubic graphs, in which the number of vertices in a longest path are much less than the half of their orders. This disprove a recent conjecture posed by Akhbari, Hasni, Favaron, Karami, Sheikholeslami.
引用
收藏
页数：5
相关论文
共 50 条
  • [31] Finding outer-connected dominating sets in interval graphs
    Lin, Chiou-Jiun
    Liu, Jia-Jie
    Wang, Yue-Li
    INFORMATION PROCESSING LETTERS, 2015, 115 (12) : 917 - 922
  • [32] Total Domination in 2-Connected Graphs and in Graphs with No Induced 6-Cycles
    Henning, Michael A.
    Yeo, Anders
    JOURNAL OF GRAPH THEORY, 2009, 60 (01) : 55 - 79
  • [33] Domination and Outer Connected Domination in Maximal Outerplanar Graphs
    Zhuang, Wei
    GRAPHS AND COMBINATORICS, 2021, 37 (06) : 2679 - 2696
  • [34] Domination and Outer Connected Domination in Maximal Outerplanar Graphs
    Wei Zhuang
    Graphs and Combinatorics, 2021, 37 : 2679 - 2696
  • [35] Pruning 2-Connected Graphs
    Chandra Chekuri
    Nitish Korula
    Algorithmica, 2012, 62 : 436 - 463
  • [36] MINIMALLY 2-CONNECTED GRAPHS
    DIRAC, GA
    JOURNAL FUR DIE REINE UND ANGEWANDTE MATHEMATIK, 1967, 228 : 204 - &
  • [37] Pruning 2-Connected Graphs
    Chekuri, Chandra
    Korula, Nitish
    ALGORITHMICA, 2012, 62 (1-2) : 436 - 463
  • [38] Cycles in 2-connected graphs
    Fan, GH
    Lv, XZ
    Wang, P
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2004, 92 (02) : 379 - 394
  • [39] Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs
    Panda, B. S.
    Pandey, Arti
    ALGORITHMS AND COMPUTATION, WALCOM 2014, 2014, 8344 : 151 - 162
  • [40] On the complexity of the minimum outer-connected dominating set problem in graphs
    Pradhan, D.
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2016, 31 (01) : 1 - 12
12345