A way to construct independence equivalent graphs

DOI10.1016/j.aml.2011.11.033zbMath1248.05087OpenAlexW1993925687MaRDI QIDQ452914

Hailiang Zhang

Publication date: 18 September 2012

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2011.11.033

zbMATH Keywords

stable setindependence polynomialindependence equivalent graphs

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38)

Related Items (3)

Independence Equivalence Classes of Paths and Cycles ⋮ Graphs whose independence fractals are line segments ⋮ Independence equivalence classes of paths

Cites Work

• Clique polynomials and independent set polynomials of graphs
• Roots of independence polynomials of well covered graphs
• Dependence polynomials
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A way to construct independence equivalent graphs