Independence equivalence classes of paths

DOI10.1016/j.disc.2022.113143zbMath1502.05190arXiv2105.01592OpenAlexW3159351212MaRDI QIDQ2092372

Boon Leong Ng

Publication date: 2 November 2022

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

independence polynomialindependence equivalence

Mathematics Subject Classification ID

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

Cites Work

• A way to construct independence equivalent graphs
• Indistinguishable trees and graphs
• Independence roots and independence fractals of certain graphs
• Clique polynomials and independent set polynomials of graphs
• Weakly distinguishing graph polynomials on addable properties
• Independence equivalence classes of cycles
• Independence Equivalence Classes of Paths and Cycles

This page was built for publication: Independence equivalence classes of paths