Enumerating maximal dissociation sets in three classes of grid graphs

Yuting Tian and Jianhua Tu

Applied Mathematics and Computation, 2024, vol. 474, issue C

Abstract: A dissociation set in a graph G is a subset of vertices inducing a subgraph of maximum degree at most 1, and a dissociation set D is maximal if it is not a proper subset of any other dissociation set. In this paper, we use the state matrix recursion algorithm to enumerate maximal dissociation sets in grid graphs, cyclical grid graphs and cylindrical grid graphs. We also analyze the growth rates of the numbers of maximal dissociation sets in the three classes of grid graphs.

Keywords: Maximal dissociation sets; Enumeration; Grid graphs; State matrix recursion algorithm (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300324001838
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:474:y:2024:i:c:s0096300324001838

DOI: 10.1016/j.amc.2024.128711

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().