Enumeration of dissociation sets in grid graphs

被引：0
|
作者：
Zhou, Wenke [1 ]
Chen, Guo [1 ]
Deng, Hongzhi [1 ]
Tu, Jianhua [1 ]
机构：
[1] Beijing Technol & Business Univ, Sch Math & Stat, Beijing 100048, Peoples R China
来源：
AIMS MATHEMATICS | 2024年 / 9卷 / 06期
基金：
北京市自然科学基金;
关键词：
dissociation sets; enumeration; grid graphs; state matrix recursion algorithm; 3-PATH VERTEX COVER; NUMBER;
D O I：
10.3934/math.2024721
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
A dissociation set of a graph G refers to a set of vertices inducing a subgraph with maximum degree at most 1 and serves as a generalization of two fundamental concepts in graph theory: Independent sets and induced matchings. The enumeration of specific substructures in grid graphs has been a captivating area of research in graph theory. Over the past few decades, the enumeration problems related to various structures in grid graphs such as Hamiltonian cycles, Hamiltonian paths, independent sets, maximal independent sets, and dominating sets have been deeply studied. In this paper, we enumerated dissociation sets in grid graphs using the state matrix recursion algorithm.
引用
收藏
页码：14899 / 14912
页数：14
相关论文
共 50 条
  • [1] Enumerating maximal dissociation sets in three classes of grid graphs
    Tian, Yuting
    Tu, Jianhua
    APPLIED MATHEMATICS AND COMPUTATION, 2024, 474
  • [2] Efficient enumeration of dominating sets for sparse graphs
    Kurita, Kazuhiro
    Wasa, Kunihiro
    Arimura, Hiroki
    Uno, Takeaki
    DISCRETE APPLIED MATHEMATICS, 2021, 303 : 283 - 295
  • [3] ENUMERATION OF LINEAR GRAPHS FOR MAPPINGS OF FINITE SETS
    RIORDAN, J
    ANNALS OF MATHEMATICAL STATISTICS, 1962, 33 (01): : 178 - +
  • [4] Efficient enumeration of dominating sets for sparse graphs
    Kurita, Kazuhiro
    Wasa, Kunihiro
    Arimura, Hiroki
    Uno, Takeaki
    Discrete Applied Mathematics, 2021, 303 : 283 - 295
  • [5] Enumeration of Hamiltonian Cycles in Some Grid Graphs
    Bodroza-Pantic, Olga
    Pantic, Bojana
    Pantic, Ilija
    Bodroza-Solarov, Marija
    MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2013, 70 (01) : 181 - 204
  • [6] Enumeration of minimal connected dominating sets for chordal graphs
    Golovach, Petr A.
    Heggernes, Pinar
    Kratsch, Dieter
    Saei, Reza
    DISCRETE APPLIED MATHEMATICS, 2020, 278 : 3 - 11
  • [7] Maximal independent sets in grid graphs
    Ortiz, Carmen
    Villanueva, Monica
    INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2017, 24 (1-2) : 369 - 385
  • [8] The number of maximal dissociation sets in unicyclic graphs
    Jin, Long
    Li, Jianxi
    Shiu, Wai Chee
    JOURNAL OF APPLIED MATHEMATICS AND COMPUTING, 2024,
  • [9] Counting the number of dissociation sets in cubic graphs
    Tu, Jianhua
    Xiao, Junyi
    Lang, Rongling
    AIMS MATHEMATICS, 2023, 8 (05): : 10021 - 10032
  • [10] Enumeration and Maximum Number of Maximal Irredundant Sets for Chordal Graphs
    Golovach, Petr A.
    Kratsch, Dieter
    Liedloff, Mathieu
    Sayadi, Mohamed Yosri
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE (WG 2017), 2017, 10520 : 289 - 302
12345