Graphs whose independence fractals are line segments
From MaRDI portal
Publication:2227937
DOI10.1007/s40840-020-00936-5zbMath1460.05142OpenAlexW3022354335MaRDI QIDQ2227937
Ankit Pradhan, Tarakanta Nayak, Sasmita Barik
Publication date: 16 February 2021
Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40840-020-00936-5
Graph polynomials (05C31) Fractals (28A80) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- 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
- The roots of the independence polynomial of a clawfree graph
- The independence fractal of a graph.
- Note on the Smallest Root of the Independence Polynomial
- Independence Equivalence Classes of Paths and Cycles
This page was built for publication: Graphs whose independence fractals are line segments