Some families of graphs with no nonzero real domination roots
From MaRDI portal
(Redirected from Publication:5009965)
Abstract: Let G be a simple graph of order n. The domination polynomial is the generating polynomial for the number of dominating sets of G of each cardinality. A root of this polynomial is called a domination root of G. Obviously 0 is a domination root of every graph G. In the study of the domination roots of graphs, this naturally raises the question: which graphs have no nonzero real domination roots? In this paper we present some families of graphs whose have this property.
Recommendations
Cites work
- A family of graphs whose independence polynomials are both palindromic and unimodal
- Bounding the roots of independence polynomials.
- Characterization of graphs using domination polynomials
- Dependence polynomials
- Domination polynomial of generalized book graphs
- Domination polynomials of \(k\)-tree related graphs
- scientific article; zbMATH DE number 3836093 (Why is no real title available?)
- scientific article; zbMATH DE number 4142076 (Why is no real title available?)
- scientific article; zbMATH DE number 3749035 (Why is no real title available?)
- scientific article; zbMATH DE number 166023 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 3443655 (Why is no real title available?)
- scientific article; zbMATH DE number 3232670 (Why is no real title available?)
- scientific article; zbMATH DE number 3305794 (Why is no real title available?)
- Introduction to domination polynomial of a graph.
- On chromatic roots of large subdivisions of graphs
- On the corona of two graphs
- On the domination polynomial of some graph operations
- On the domination polynomials of friendship graphs
- On the graphs with four distinct domination roots
- On the location of roots of independence polynomials
- On the roots of domination polynomial of graphs
- On the roots of domination polynomials
- On the zeros of domination polynomial of a graph
- Recurrence relations and splitting formulas for the domination polynomial
- The roots of the independence polynomial of a clawfree graph
Cited in
(5)
This page was built for publication: Some families of graphs with no nonzero real domination roots
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5009965)