Some families of graphs with no nonzero real domination roots
Let G be a simple graph of order n. The domination polynomial of G is the polynomial D(G, x) = ∑ni = γ(G)d(G, i)xi, where d(G, i) is the number of dominating sets of G of size i and γ(G) is the domination number of G. A root of D(G, x) is called a domination root of G. Obviously, 0 is a domination r...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | EJournal Article |
| Published: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB,
2018-04-03.
|
| Subjects: | |
| Online Access: | Get Fulltext |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Internet
Get Fulltext3rd Floor Main Library
| Call Number: |
A1234.567 |
|---|---|
| Copy 1 | Available |