Formalization of the Domination Chain with Weighted Parameters
| dc.citation.title | 10th International Conference on Interactive Theorem Proving (ITP 2019). Editors: John Harrison, John O’Leary, and Andrew Tolmach; Article No. 36; pp. 36:1–36:7 Leibniz International Proceedings in Informatics Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany | es |
| dc.contributor.organizer | LIPIcs – Leibniz International Proceedings in Informatics | es |
| dc.creator | Severín, Daniel Esteban | |
| dc.date.accessioned | 2020-09-21T20:27:48Z | |
| dc.date.available | 2020-09-21T20:27:48Z | |
| dc.date.issued | 2019 | |
| dc.description.abstract | The Cockayne-Hedetniemi Domination Chain is a chain of inequalities between classic parameters of graph theory: for a given graph G, ir(G) ≤ γ(G) ≤ ι(G) ≤ α(G) ≤ Γ(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. | es |
| dc.description.fil | Fil: Severín, Daniel. Universidad Nacional de Rosario. FCEIA. CONICET. Rosario; Argentina | es |
| dc.format | application/pdf | |
| dc.identifier.isbn | 978-3-95977-122-1 | |
| dc.identifier.issn | 1868-8969 | |
| dc.identifier.uri | http://hdl.handle.net/2133/18978 | |
| dc.language.iso | eng | es |
| dc.relation.haspart | https://dx.doi.org/10.17632/h5j5rvrz2r.2 | |
| dc.relation.ispartofseries | http://hdl.handle.net/2133/18977 | es |
| dc.relation.publisherversion | https://doi.org/10.4230/LIPIcs.ITP.2019.36 | es |
| dc.rights | openAccess | es |
| dc.rights.holder | Autor | es |
| dc.rights.text | https://creativecommons.org/licenses/by/3.0/ | es |
| dc.rights.uri | https://creativecommons.org/licenses/by/3.0/ | * |
| dc.subject | Mathematics of computing | es |
| dc.subject | Graph theory | es |
| dc.subject | https://purl.org/becyt/ford/1.1 | es |
| dc.subject | Domination Chain | es |
| dc.subject | Coq | es |
| dc.subject | Formalization of Mathematics | es |
| dc.title | Formalization of the Domination Chain with Weighted Parameters | es |
| dc.type | conferenceObject | |
| dc.type | documento de conferencia | |
| dc.type | publishedVersion | |
| dc.type.collection | comunicaciones | |
| dc.type.version | publishedVersion | es |