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

Junyi Xiao and Jianhua Tu

Applied Mathematics and Computation, 2023, vol. 444, issue C

Abstract: Let G be a graph. An independent set of G is a subset of vertices no two of which are connected by an edge. Denote by I(G) the set of all independent sets of G. The independence polynomial of G is I(G;λ)=∑I∈I(G)λ|I|.

Keywords: Independent sets; Claw-free cubic graphs; Independence polynomials; Triangular prism; The occupancy method (search for similar items in EconPapers)
Date: 2023
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300322008803
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:444:y:2023:i:c:s0096300322008803

DOI: 10.1016/j.amc.2022.127812

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 ().