Graphs whose certain polynomials have few distinct roots
From MaRDI portal
Publication:470526
DOI10.1155/2013/195818zbMath1298.05167arXiv1112.0838WikidataQ58992092 ScholiaQ58992092MaRDI QIDQ470526
Publication date: 12 November 2014
Published in: ISRN Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1112.0838
05C31: Graph polynomials
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graphs with few matching roots
- The domination polynomial of a graph at \(-1\)
- Algebraic integers as chromatic and domination roots
- Independence roots and independence fractals of certain graphs
- On the location of roots of independence polynomials
- On the roots of edge cover polynomials of graphs
- On the edge cover polynomial of a graph
- Characterization of graphs using domination polynomials
- Graphs with three distinct eigenvalues and largest eigenvalue less than 8
- Dominating sets and domination polynomials of paths
- Multiplicative cones - a family of three eigenvalue graphs
- On a general class of graph polynomials
- An introduction to matching polynomials
- Nonregular graphs with three eigenvalues
- Problems in algebraic combinatorics
- Which graphs are determined by their spectrum?
- Roots of independence polynomials of well covered graphs
- On graphs with three eigenvalues
- Small regular graphs with four eigenvalues
- Algebraic matching theory
- Regular graphs with four eigenvalues
- The cyclomatic number of a graph and its independence polynomial at \(- 1\)
- On the roots of domination polynomials
- On the corona of two graphs
- Bounds on the Complex Zeros of (Di)Chromatic Polynomials and Potts-Model Partition Functions
- On the graphs with four distinct domination roots
- Cycles are determined by their domination polynomials
- Dominatind sets and domination polynomials of certain graphs. II
- On the theory of the matching polynomial
- Introduction to Domination Polynomial of a Graph
