Optimal domination polynomials (Q2227988)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Optimal domination polynomials	scientific article

Statements

scholarly article

0 references

Optimal domination polynomials (English)

0 references

0 references

0 references

0 references

Graphs and Combinatorics

0 references

publication date

16 February 2021

0 references

full work available at URL

https://arxiv.org/abs/1904.06267

0 references

zbMATH Keywords

domination polynomial

0 references

optimality

0 references

reliability

0 references

MaRDI profile type

MaRDI publication profile

0 references

Characterization of graphs using domination polynomials

0 references

Introduction to Domination Polynomial of a Graph

0 references

SOME CONJECTURED UNIFORMLY OPTIMAL RELIABLE NETWORKS

0 references

Least reliable networks and the reliability domination

0 references

On the existence of uniformly optimally reliable networks

0 references

Nonexistence of optimal graphs for all terminal reliability

0 references

Optimal graphs for independence and \(k\)-independence polynomials

0 references

Domination reliability

0 references

Uniformly optimally reliable graphs

0 references

Uniformly-most reliable networks do not always exist

0 references

Graphs with least number of colorings

0 references

Optimal graphs for chromatic polynomials

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/s00373-020-02202-8

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2227988

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2227988&oldid=36654691"