On the Number of Connected Sets in Bounded Degree Graphs

被引：4
|
作者：
Kangas, Kustaa [1 ]
Kaski, Petteri [2 ]
Koivisto, Mikko [1 ]
Korhonen, Janne H. [1 ]
机构：
[1] Univ Helsinki, Dept Comp Sci, HIIT, POB 68, Helsinki 00014, Finland
[2] Aalto Univ, HIIT, Dept Informat & Comp Sci, POB 15400, Aalto 00076, Finland
来源：
GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE | 2014年 / 8747卷
基金：
芬兰科学院; 欧盟地平线“2020”; 欧洲研究理事会;
关键词：
INDEPENDENT SETS;
D O I：
10.1007/978-3-319-12340-0_28
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
A set of vertices in a graph is connected if the set induces a connected subgraph. Using Shearer's entropy lemma, we show that the number of connected sets in an n-vertex graph with maximum vertex degree d is O(1.9351(n)) for d = 3, O(1.9812(n)) for d = 4, and O(1.9940(n)) for d = 5. Dually, we construct infinite families of generalized ladder graphs whose number of connected sets is bounded from below by Omega(1.5537(n)) for d = 3, Omega(1.6180(n)) for d = 4, and Omega(1.7320(n)) for d = 5.
引用
收藏
页码：336 / 347
页数：12
相关论文
共 50 条
  • [21] 2-CONNECTED COVERINGS OF BOUNDED DEGREE IN 3-CONNECTED GRAPHS
    GAO, ZC
    JOURNAL OF GRAPH THEORY, 1995, 20 (03) : 327 - 338
  • [22] Enumerating minimal connected dominating sets in graphs of bounded chordality
    Golovach, Petr A.
    Heggernes, Pinar
    Kratsch, Dieter
    THEORETICAL COMPUTER SCIENCE, 2016, 630 : 63 - 75
  • [23] Hamiltonian properties of locally connected graphs with bounded vertex degree
    Gordon, Valery S.
    Orlovich, Yury L.
    Potts, Chris N.
    Strusevich, Vitaly A.
    DISCRETE APPLIED MATHEMATICS, 2011, 159 (16) : 1759 - 1774
  • [24] On the Maximum Number of Edges in Chordal Graphs of Bounded Degree and Matching Number
    Jean R. S. Blair
    Pinar Heggernes
    Paloma T. Lima
    Daniel Lokshtanov
    Algorithmica, 2022, 84 : 3587 - 3602
  • [25] On the maximum number of edges in planar graphs of bounded degree and matching number
    Jaffke, Lars
    Lima, Paloma T.
    DISCRETE MATHEMATICS, 2023, 346 (08)
  • [26] On the Maximum Number of Edges in Chordal Graphs of Bounded Degree and Matching Number
    Blair, Jean R. S.
    Heggernes, Pinar
    Lima, Paloma T.
    Lokshtanov, Daniel
    ALGORITHMICA, 2022, 84 (12) : 3587 - 3602
  • [27] Counting the Number of Weakly Connected Dominating Sets of Graphs
    Alikhani, Saeid
    Jahari, Somayeh
    Mehryar, Mohammad
    MALAYSIAN JOURNAL OF MATHEMATICAL SCIENCES, 2016, 10 (03): : 297 - 306
  • [28] On the maximum number of maximum independent sets in connected graphs
    Mohr, Elena
    Rautenbach, Dieter
    JOURNAL OF GRAPH THEORY, 2021, 96 (04) : 510 - 521
  • [29] Independent Sets near the Lower Bound in Bounded Degree Graphs
    Dvorak, Zdenek
    Lidicky, Bernard
    34TH SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2017), 2017, 66
  • [30] Compact Representation of Interval Graphs of Bounded Degree and Chromatic Number
    Chakraborty, Sankardeep
    Jo, Seungbum
    DCC 2022: 2022 DATA COMPRESSION CONFERENCE (DCC), 2022, : 103 - 112
12345