Independence Equivalence Classes of Paths and Cycles

zbMath1429.05152arXiv1810.05317MaRDI QIDQ5206913

Ben Cameron, Iain Beaton, Jason I. Brown

Publication date: 19 December 2019

Full work available at URL: https://arxiv.org/abs/1810.05317

zbMATH Keywords

independence polynomial

Mathematics Subject Classification ID

Graph polynomials (05C31) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (3)

Graphs whose independence fractals are line segments ⋮ Independence equivalence classes of cycles ⋮ Independence equivalence classes of paths

Uses Software

• nauty
• Traces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A way to construct independence equivalent graphs
• Independence roots and independence fractals of certain graphs
• On the location of roots of independence polynomials
• On the location of roots of graph polynomials
• The roots of the independence polynomial of a clawfree graph
• Roots of independence polynomials of well covered graphs
• Some results on the independence polynomial of unicyclic graphs
• On the coefficients of the independence polynomial of graphs
• Practical graph isomorphism. II.
• On the roots of independence polynomials of almost all very well-covered graphs
• On chromatic equivalence of graphs
• On Weakly Distinguishing Graph Polynomials

This page was built for publication: Independence Equivalence Classes of Paths and Cycles