3 papers
math.CO2025
On the enumeration of connected sets in finite cylindrical lattice graphs
Hongxia Ma, Xian'an Jin, Meiqiao Zhang
A connected set in a graph is a non-empty set of vertices that induces a connected subgraph. In an infinite lattice, a connected set is often referred to as a lattice animal, whose…
math.CO2025
The burning number conjecture holds for trees of order with at most degree-2 vertices
Jiajun Ning, Xian'an Jin, Meiqiao Zhang
Inspired by the spread of information in social networks and graph-theoretic processes such as Firefighting and graph cleaning, Bonato, Janssen and Roshanbin introduced in 2016 the…
math.CO2025
A sharp upper bound for the number of connected sets in any grid graph
Hongxia Ma, Xian'an Jin, Weiling Yang +1
A connected set in a graph is a subset of vertices whose induced subgraph is connected. Although counting the number of connected sets in a graph is generally a \#P-complete proble…