A way to construct independence equivalent graphs

DOI10.1016/J.AML.2011.11.033zbMATH Open1248.05087OpenAlexW1993925687MaRDI QIDQ452914FDOQ452914

Authors: 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

Recommendations

• On the independence graph of a graph
• Independence in connected graphs
• Independence and graph homomorphisms graph homomorphisms
• Independence in direct-product graphs
• Graphs with equal independence and annihilation numbers
• scientific article; zbMATH DE number 38156
• scientific article; zbMATH DE number 1339505
• scientific article; zbMATH DE number 1174929
• Independent sets in graphs

zbMATH Keywords

independence polynomialstable setindependence equivalent graphs

Mathematics Subject Classification ID

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

Cites Work

• Roots of independence polynomials of well covered graphs
• Dependence polynomials
• Title not available (Why is that?)
• Title not available (Why is that?)
• Clique polynomials and independent set polynomials of graphs
• Title not available (Why is that?)
• Bounding the roots of independence polynomials.
• On circulants uniquely characterized by their independence polynomials.

Cited In (6)

• Graphs whose independence fractals are line segments
• Independence equivalence classes of cycles
• Independence equivalence classes of paths
• On circulants uniquely characterized by their independence polynomials.
• On independence polynomials of quotient based graphs for finite abelian groups
• Independence equivalence classes of paths and cycles

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q452914)