LIPIcs.ITP.2019.36.pdf
- Filesize: 394 kB
- 7 pages
Document
Formalization of the Domination Chain with Weighted Parameters (Short Paper)
Author
Daniel E. Severín 
-
Part of:
Volume:
10th International Conference on Interactive Theorem Proving (ITP 2019)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: International Conference on Interactive Theorem Proving (ITP) - License:
Creative Commons Attribution 3.0 Unported license
- Publication date: 2019-09-05
File
Document Identifiers
Author Details
Acknowledgements
I want to thank Ricardo Katz for his careful reading and suggestions.
Cite AsGet BibTex
Daniel E. Severín. Formalization of the Domination Chain with Weighted Parameters (Short Paper). In 10th International Conference on Interactive Theorem Proving (ITP 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 141, pp. 36:1-36:7, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
https://doi.org/10.4230/LIPIcs.ITP.2019.36
https://doi.org/10.4230/LIPIcs.ITP.2019.36
Abstract
The Cockayne-Hedetniemi Domination Chain is a chain of inequalities between classic parameters of graph theory: for a given graph G, ir(G) <= gamma(G) <= iota(G) <= alpha(G) <= Gamma(G) <= IR(G). These parameters return the maximum/minimum cardinality of a set satisfying some property. However, they can be generalized for graphs with weighted vertices where the objective is to maximize/minimize the sum of weights of a set satisfying the same property, and the domination chain still holds for them. In this work, the definition of these parameters as well as the chain is formalized in Coq/Ssreflect.
Subject Classification
ACM Subject Classification
- Mathematics of computing → Graph theory
Keywords
- Domination Chain
- Coq
- Formalization of Mathematics
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads