Výsledky vyhledávání

Distance monotone graphs and a new characterization of hypercubes

Autor: Gustav Burosch, Jean-Marie Laborde, Ivan Havel

Publikováno v: Discrete Mathematics. 110:9-16

The aim of this paper is to study the class of s.c. distance monotone graphs which arise naturally when investigating some intersection properties of graphs. A new characterization of hypercubes is also obtained.

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::234f00470d50c371bdcd4b6efc329925
https://doi.org/10.1016/0012-365x(92)90696-d

Zobrazit plný text záznamu

Component Group Diagnosability Via Directional Resolution

Autor: Ivan Havel

Publikováno v: 13th IFAC Symposium on Information Control Problems in Manufacturing.

This paper addresses simplification of diagnostic models of systems that can be described in propositional logic. Performing diagnostics on the entire model of a system when only a few variables are expected to be observed, is not efficient. If we kn

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f03ed2ef0a04a64984636e47aab88652
https://doi.org/10.3182/20090603-3-ru-2001.00055

Zobrazit plný text záznamu

One-legged caterpillars span hypercubes

Autor: Petr Liebl, Ivan Havel

Publikováno v: Journal of Graph Theory. 10:69-77

The aim of this paper is to prove that any balanced caterpillar having 2n vertices and maximum degree 3 spans the n-dimensional hypercube.

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::cc844b606b36ed66a25d8bd60317372f
https://doi.org/10.1002/jgt.3190100110

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání