Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Chassidy Bozeman"'
Autor:
Kira Adaricheva, Heather Smith Blake, Chassidy Bozeman, Nancy E. Clarke, Ruth Haas, Margaret-Ellen Messinger, Karen Seyffarth
The dominating graph of a graph $H$ has as its vertices all dominating sets of $H$, with an edge between two dominating sets if one can be obtained from the other by the addition or deletion of a single vertex of $H$. In this paper we prove that the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d2c9376c1ed16209dab75f120b07ac0e
Autor:
Kira Adaricheva, Chassidy Bozeman, Margaret-Ellen Messinger, Ruth Haas, Nancy E. Clarke, Karen Seyffarth, Heather C. Smith
Publikováno v:
Association for Women in Mathematics Series ISBN: 9783030779825
The dominating graph of a graph G has as its vertices all dominating sets of G, with an edge between two dominating sets if one can be obtained from the other by adding or deleting a single vertex of G. This is an example of a reconfiguration graph.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d0c07e3c5c684c7cf6b96ffd9571cbd6
https://doi.org/10.1007/978-3-030-77983-2_6
https://doi.org/10.1007/978-3-030-77983-2_6
Let $G=(V,E)$ be a finite connected graph along with a coloring of the vertices of $G$ using the colors in a given set $X$. In this paper, we introduce multi-color forcing, a generalization of zero-forcing on graphs, and give conditions in which the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::86b5f05daf3dab0afe6ba92bf22fda7e
http://arxiv.org/abs/1912.02001
http://arxiv.org/abs/1912.02001
Publikováno v:
Journal of Combinatorial Optimization. 37:935-956
Power domination in graphs arises from the problem of monitoring an electric power system by placing as few measurement devices in the system as possible. A power dominating set of a graph is a set of vertices that observes every vertex in the graph,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8851b3dd5f99a7c8769b49b21520ae9d
https://doi.org/10.1007/s10878-018-0330-6
https://doi.org/10.1007/s10878-018-0330-6
Publikováno v:
Involve 10, no. 5 (2017), 767-779
Given a graph [math] , the tree cover number of the graph, denoted [math] , is the minimum number of vertex disjoint simple trees occurring as induced subgraphs that cover all the vertices of G. This graph parameter was introduced in 2011 as a tool f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a559939ce995e8415f1aff3119887532
https://projecteuclid.org/euclid.involve/1508433091
https://projecteuclid.org/euclid.involve/1508433091
Autor:
Chassidy Bozeman, Kathleen Nowak, Aaron Michael Rodriguez, Jephian C.-H. Lin, Gabi Maurer, AnnaVictoria Ellsworth, James Strickland, Leslie Hogben
Publikováno v:
The Electronic Journal of Linear Algebra. 27
A loop graph $\mf G$ is a finite undirected graph that allows loops but does not allow multiple edges. The set $\sym(\lG)$ of real symmetric matrices associated with a loop graph $\lG$ of order $n$ is the set of symmetric matrices $A=[a_{ij}]\in\Rnn$
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dba7ed442a4c55ecbb29343c8ca9c40f
https://doi.org/10.13001/1081-3810.2007
https://doi.org/10.13001/1081-3810.2007