Zobrazeno 1 - 10
of 22
pro vyhledávání: '"Debra L. Boutin"'
Autor:
Debra L. Boutin, Sally Cockburn
Publikováno v:
Journal of Graph Theory. 98:389-404
A graph $G$ is said to be $d$-distinguishable if there is a labeling of the vertices with $d$ labels so that only the trivial automorphism preserves the labels. The smallest such $d$ is the distinguishing number, Dist($G$). A subset of vertices $S$ i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d3ede57b8c247cdabea6558a63c7e547
https://doi.org/10.1002/jgt.22704
https://doi.org/10.1002/jgt.22704
Autor:
Debra L. Boutin
Publikováno v:
The Art of Discrete and Applied Mathematics. 6:#P2.03
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f8ff8a106542098ce23d260bf1dfff11
https://doi.org/10.26493/2590-9770.1463.f59
https://doi.org/10.26493/2590-9770.1463.f59
Publikováno v:
Association for Women in Mathematics Series ISBN: 9783030779825
The Mycielskian construction, denoted μ(G), takes a finite simple graph G to a larger graph with of the same clique number but larger chromatic number. The generalized Mycielskian construction, denoted μt(G), takes G to a larger graph with the same
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fe23aec1a81106473b67b840fde69664
https://doi.org/10.1007/978-3-030-77983-2_5
https://doi.org/10.1007/978-3-030-77983-2_5
A set $S$ of vertices is a determining set for a graph $G$ if every automorphism of $G$ is uniquely determined by its action on $S$. The size of a smallest determining set for $G$ is called its determining number, $Det(G)$. A graph $G$ is said to be
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::30f37eddb06934d867d20598a981673a
http://arxiv.org/abs/2007.15284
http://arxiv.org/abs/2007.15284
Autor:
Debra L. Boutin
Publikováno v:
Discrete Mathematics. 344:112512
A graph G is said to be 2-distinguishable if there is a labeling of the vertices with two labels so that only the trivial automorphism preserves the labels. The minimum size of a label class, over all 2-distinguishing labelings, is called the cost of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8d9dbbbbb78807e2c8c0049ad4aedc63
https://doi.org/10.1016/j.disc.2021.112512
https://doi.org/10.1016/j.disc.2021.112512
Autor:
Debra L. Boutin, Ecaterina Sava-Huss, Wilfried Imrich, Tullio Ceccherini-Silberstein, Maura Salvatori
Publikováno v:
Groups, Graphs and Random Walks
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4462c2c5e06dcda703c04d917d51ece0
https://doi.org/10.1017/9781316576571.005
https://doi.org/10.1017/9781316576571.005
Autor:
Sally Cockburn, Debra L. Boutin
Publikováno v:
Journal of Graph Theory. 69:97-113
A geometric graph is a simple graph drawn on points in the plane, in general position, with straightline edges. A geometrichomomorphism from to is a vertex map that preserves adjacencies and crossings. This work proves some basic properties of geomet
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d599bbaf1f9e428da347f6dd1b9a0949
https://doi.org/10.1002/jgt.20566
https://doi.org/10.1002/jgt.20566
Publikováno v:
Discrete Mathematics. 310:2725-2734
A graph has thickness t if the edges can be decomposed into t and no fewer planar layers. We study one aspect of a generalization of Ringel's famous Earth-Moon problem: what is the largest chromatic number of any thickness-2 graph? In particular, giv
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f10389520268e97693bc5852c6a4bccf
https://doi.org/10.1016/j.disc.2010.04.019
https://doi.org/10.1016/j.disc.2010.04.019
Autor:
Debra L. Boutin
Publikováno v:
Graphs and Combinatorics. 25:789-806
A subset U of vertices of a graph G is called a determining set if every automorphism of G is uniquely determined by its action on the vertices of U. A subset W is called a resolving set if every vertex in G is uniquely determined by its distances to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2a81e19d76fdbdbe381d8a8443fb40fd
https://doi.org/10.1007/s00373-010-0880-6
https://doi.org/10.1007/s00373-010-0880-6
Autor:
Debra L. Boutin
Publikováno v:
Journal of Graph Theory. 61:77-87
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f4094e5fb48c2d31652355b019dd3709
https://doi.org/10.1002/jgt.20368
https://doi.org/10.1002/jgt.20368