2 papers
math.CO2025
Connectedness of independence attractors of graphs with independence number three
Moumita Manna, Tarakanta Nayak
An independent set in a simple graph is a set of pairwise non-adjacent vertices in . The independence polynomial of , denoted by is defined as $1 + a_1 z + a_2 z^2+…
math.CO2025
Circles and line segments as independence attractors of graphs
Garima Khetawat, Moumita Manna, Tarakanta Nayak
By an independent set in a simple graph , we mean a set of pairwise non-adjacent vertices in . The independence polynomial of is defined as $I_G(z)=a_0 + a_1 z + a_2 z^2+…