Cheryl Grood
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Interests
Cheryl Grood has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Beth Bjorkman
Air Force Research Laboratory, Wright-Patterson Air Force Base, USA
1 shared publication - Bonnie Jacob
Science and Mathematics Department, National Technical Institute for the Deaf, Rochester Institute of Technology, Rochester, USA
1 shared publication - Carolyn Reinhart
Department of Mathematics and Statistics, Swarthmore College, Swarthmore, USA
1 shared publication - Chassidy Bozeman
Department of Mathematics and Statistics, Mount Holyoke College, South Hadley, USA
1 shared publication - Daniela Ferrero
Department of Mathematics, Texas State University, San Marcos, USA
1 shared publication - Leslie Hogben
Department of Mathematics, Iowa State University, Ames, USA
1 shared publication
Latest Publications
- Open Access
- 13 January 2026
- Published by Springer Nature in La Matematica
- Vol. 5 (1) , 8
Power Domination Reconfiguration
Reconfiguration examines relationships among solutions to a problem. Power domination models placement of monitoring units that allow monitoring of an entire electrical power network, and information about modifying one monitoring solution to another has applications. The study of token addition and removal and token jumping reconfiguration graphs for power domination is initiated. Some results established here can be extended by applying the methods used for power domination to reconfiguration graphs for other parameters. A universal framework for the study of reconfiguration of parameters that are defined from sets of vertices of a graph and satisfy certain rules is introduced. This allows application of some of the results to additional parameters such as domination and zero forcing.
- 13 January 2026
- Published by Springer Nature in La Matematica
- Vol. 5 (1) , 8
Open AccessPower Domination Reconfiguration
Reconfiguration examines relationships among solutions to a problem. Power domination models placement of monitoring units that allow monitoring of an entire electrical power network, and information about modifying one monitoring solution to another has applications. The study of token addition and removal and token jumping reconfiguration graphs for power domination is initiated. Some results established here can be extended by applying the methods used for power domination to reconfiguration graphs for other parameters. A universal framework for the study of reconfiguration of parameters that are defined from sets of vertices of a graph and satisfy certain rules is introduced. This allows application of some of the results to additional parameters such as domination and zero forcing.
- Open Access
- 18 December 2001
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 9 (1) , R2
A Specht Module Analog for the Rook Monoid
The wealth of beautiful combinatorics that arise in the representation theory of the symmetric group is well-known. In this paper, we analyze the representations of a related algebraic structure called the rook monoid from a combinatorial angle. In particular, we give a combinatorial construction of the irreducible representations of the rook monoid. Since the rook monoid contains the symmetric group, it is perhaps not surprising that the construction outlined in this paper is very similar to the classic combinatorial construction of the irreducible $S_n$-representations: namely, the Specht modules.
- 18 December 2001
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 9 (1) , R2
Open AccessA Specht Module Analog for the Rook Monoid
The wealth of beautiful combinatorics that arise in the representation theory of the symmetric group is well-known. In this paper, we analyze the representations of a related algebraic structure called the rook monoid from a combinatorial angle. In particular, we give a combinatorial construction of the irreducible representations of the rook monoid. Since the rook monoid contains the symmetric group, it is perhaps not surprising that the construction outlined in this paper is very similar to the classic combinatorial construction of the irreducible $S_n$-representations: namely, the Specht modules.