Maximizing the number of independent sets in claw-free cubic graphs

DOI10.1016/j.amc.2022.127812OpenAlexW4313400216MaRDI QIDQ2698077

Junyi Xiao, Jian-hua Tu

Publication date: 21 April 2023

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2022.127812

zbMATH Keywords

independent setsindependence polynomialstriangular prismclaw-free cubic graphsoccupancy method

Mathematics Subject Classification ID

Graph theory (05Cxx) Equilibrium statistical mechanics (82Bxx) Special processes (60Kxx)

Cites Work

• Ergodicity of the hard-core model on \(\mathbb{Z}^ 2\) with parity-dependent activities
• Minimizing the number of independent sets in triangle-free regular graphs
• Counting independent sets in cubic graphs of given girth
• The maximum number of complete subgraphs in a graph with given maximum degree
• An Entropy Approach to the Hard-Core Model on Bipartite Graphs
• The Number of Independent Sets in a Regular Graph
• On weighted graph homomorphisms
• Independent sets, matchings, and occupancy fractions

This page was built for publication: Maximizing the number of independent sets in claw-free cubic graphs