On the number of dependent sets in a connected graph

被引：0
|
作者：
Horrocks, DGC [1 ]
机构：
[1] Univ Prince Edward Isl, Dept Math & Comp Sci, Charlottetown, PE C1A 4P3, Canada
来源：
ARS COMBINATORIA | 1999年 / 53卷
关键词：
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
A set X of vertices of a graph is said to be dependent if X is not an independent set. For the graph G, let P-k(G) denote the set of dependent sets of cardinality k. In this paper, we show that if G is a connected graph on 2n vertices where n greater than or equal to 3 then \P-n(G)\ greater than or equal to \Pn+1(G)\. This study is motivated by a conjecture of Lih.
引用
收藏
页码：239 / 247
页数：9
相关论文
共 50 条
  • [21] Bounds on the connected domination number of a graph
    Desormeaux, Wyatt J.
    Haynes, Teresa W.
    Henning, Michael A.
    DISCRETE APPLIED MATHEMATICS, 2013, 161 (18) : 2925 - 2931
  • [22] Neighborhood connected domatic number of a graph
    Arumugam, S.
    Sivagnanam, C.
    Journal of Combinatorial Mathematics and Combinatorial Computing, 2010, 75 : 239 - 249
  • [23] THE CONNECTED DETOUR MONOPHONIC NUMBER OF A GRAPH
    Titus, P.
    Santhakumaran, A. P.
    Ganesamoorthy, K.
    TWMS JOURNAL OF APPLIED AND ENGINEERING MATHEMATICS, 2016, 6 (01): : 75 - 86
  • [24] THE CONNECTED DOUBLE GEODETIC NUMBER OF A GRAPH
    Santhakumaran, A. P.
    Jebaraj, T.
    JOURNAL OF APPLIED MATHEMATICS & INFORMATICS, 2021, 39 (1-2): : 155 - 163
  • [25] ON THE CONNECTED DETOUR MONOPHONIC NUMBER OF A GRAPH
    Titus, P.
    Ganesamoorthy, K.
    TWMS JOURNAL OF APPLIED AND ENGINEERING MATHEMATICS, 2021, 11 (04): : 966 - 974
  • [26] Bounds on the Connected Forcing Number of a Graph
    Davila, Randy
    Henning, Michael A.
    Magnant, Colton
    Pepper, Ryan
    GRAPHS AND COMBINATORICS, 2018, 34 (06) : 1159 - 1174
  • [27] CONNECTED COTOTAL DOMINATION NUMBER OF A GRAPH
    Basavanagoud, B.
    Hosamani, S. M.
    TRANSACTIONS ON COMBINATORICS, 2012, 1 (02) : 17 - 25
  • [28] The Outer Connected Geodetic Number of a Graph
    Ganesamoorthy, K.
    Jayanthi, D.
    PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES INDIA SECTION A-PHYSICAL SCIENCES, 2021, 91 (02) : 195 - 200
  • [29] Connected Dominating Sets and a New Graph Invariant
    Bercov, Vladimir
    COMPUTER SCIENCE JOURNAL OF MOLDOVA, 2019, 27 (01) : 23 - 33
  • [30] VISIBILITIES AND SETS OF SHORTEST PATHS IN A CONNECTED GRAPH
    NEBESKY, L
    CZECHOSLOVAK MATHEMATICAL JOURNAL, 1995, 45 (03) : 563 - 570
12345