Graphs and combinatorics, 2020-09, Vol.36 (5), p.1477-1487
2020
Details
- Autor(en) / Beteiligte
- Titel
- Optimal Domination Polynomials
- Ist Teil von
- Graphs and combinatorics, 2020-09, Vol.36 (5), p.1477-1487
- Ort / Verlag
- Tokyo: Springer Japan
- Erscheinungsjahr
- 2020
- Link zum Volltext
- Quelle
- SpringerLink
- Beschreibungen/Notizen
- Let G be a graph on n vertices and m edges and D ( G , x ) the domination polynomial of G . In this paper we completely characterize the values of n and m for which optimal graphs exist for domination polynomials. We also show that there does not always exist least optimal graphs for the domination polynomial. Applications to network reliability are highlighted.
- Sprache
- Englisch
- Identifikatoren
- ISSN: 0911-0119eISSN: 1435-5914DOI: 10.1007/s00373-020-02202-8Titel-ID: cdi_proquest_journals_2441569071
- Format
- –
- Schlagworte
- Apexes, Combinatorics, Engineering Design, Graph theory, Graphs, Mathematics, Mathematics and Statistics, Network reliability, Original Paper, Polynomials