Domination Chain with Weighted Parameters (Coq files)

This code contains a formal description of basic facts about Graph Theory and Domination Theory in the language Coq/Ssreflect. It is called DomTheory and consists of: *) The proof that the sum of degrees equals the cardinal of the edge set. *) Definitions and results about open and closed neighborho...

Descripción completa

Detalles Bibliográficos
Autor principal: Severín, Daniel Esteban
Formato: other conjunto de datos publishedVersion
Lenguaje:Inglés
Publicado: 2020
Materias:
Formalization of Mathematics
Domination Chain
Coq
https://purl.org/becyt/ford/1.1
Mathematics of computing
Graph theory
Acceso en línea:http://hdl.handle.net/2133/18977
http://hdl.handle.net/2133/18977
Aporte de:
Repositorio Hipermedial de la Universidad Nacional de Rosario (UNR) de Universidad Nacional de Rosario
id I15-R121-2133-18977
record_format dspace
institution Universidad Nacional de Rosario
institution_str I-15
repository_str R-121
collection Repositorio Hipermedial de la Universidad Nacional de Rosario (UNR)
language Inglés
orig_language_str_mv eng
topic Formalization of Mathematics
Domination Chain
Coq
https://purl.org/becyt/ford/1.1
Mathematics of computing
Graph theory
spellingShingle Formalization of Mathematics
Domination Chain
Coq
https://purl.org/becyt/ford/1.1
Mathematics of computing
Graph theory
Severín, Daniel Esteban
Domination Chain with Weighted Parameters (Coq files)
topic_facet Formalization of Mathematics
Domination Chain
Coq
https://purl.org/becyt/ford/1.1
Mathematics of computing
Graph theory
description This code contains a formal description of basic facts about Graph Theory and Domination Theory in the language Coq/Ssreflect. It is called DomTheory and consists of: *) The proof that the sum of degrees equals the cardinal of the edge set. *) Definitions and results about open and closed neighborhoods, stable sets, dominating sets, irredundant sets, hereditary and superhereditary properties, maximal/minimal sets and sets of maximum/minimum weight. *) The (weighted version of the) Cockayne-Hedetniemi domination chain. *) Examples of proofs with domination parameters on complete graphs. This code also contains: *) A browsable version made with the tool CoqDocJS, with some ''pretty-print'' symbols (like empty set, summation and set comprehension) added later. *) A solver that computes the (unweighted and weighted versions of) parameters gamma, ii, alpha, Gamma and IR. *) (experimental) The solver also generates a Coq file with a proof of alpha(G) >= k, where k is the size of the best stable set found during the optimization. *) A set of instances.
format other
conjunto de datos
publishedVersion
author Severín, Daniel Esteban
author_facet Severín, Daniel Esteban
author_sort Severín, Daniel Esteban
title Domination Chain with Weighted Parameters (Coq files)
title_short Domination Chain with Weighted Parameters (Coq files)
title_full Domination Chain with Weighted Parameters (Coq files)
title_fullStr Domination Chain with Weighted Parameters (Coq files)
title_full_unstemmed Domination Chain with Weighted Parameters (Coq files)
title_sort domination chain with weighted parameters (coq files)
publishDate 2020
url http://hdl.handle.net/2133/18977
http://hdl.handle.net/2133/18977
work_keys_str_mv AT severindanielesteban dominationchainwithweightedparameterscoqfiles
bdutipo_str Repositorios
_version_ 1764820409983696896

Ejemplares similares