Ann N. Trenk
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Ann N. Trenk has a total of 29 co-authors. Here are the top co-authors by number of shared publications:
- Martin Charles Golumbic
University of Haifa
12 shared publications - Karen L. Collins
Department of Mathematics and Computer Science, Wesleyan University, Middletown, USA
8 shared publications - Alan Shuchat
Wellesley College
5 shared publications - Randy Shull
Wellesley College
5 shared publications - Garth Isaak
Department of Mathematics, Lehigh University, Bethlehem, PA 18015
3 shared publications - Simona Boyadzhiyska
Institut für Mathematik, Freie Universitat Berlin, Berlin, Germany
3 shared publications
Latest Publications
- Open Access
- 31 December 2024
- Published by Combinatorial Press in Ars Combinatoria
- Vol. 161 (1) , 211-230
The 2 -burning Number of a Graph
We study a discrete-time model for the spread of information in a graph, motivated by the idea that people believe a story when they learn of it from two different origins. Similar to the burning number, in this problem, information spreads in rounds and a new source can appear in each round. For a graph , we are interested in , the minimum number of rounds until the information has spread to all vertices of graph . We are also interested in finding , the minimum number of sources necessary so that the information spreads to all vertices of in rounds. In addition to general results, we find and for the classes of spiders and wheels and show that their behavior differs with respect to these two parameters. We also provide examples and prove upper bounds for these parameters for Cartesian products of graphs.
- 31 December 2024
- Published by Combinatorial Press in Ars Combinatoria
- Vol. 161 (1) , 211-230
Open AccessThe 2 -burning Number of a Graph
We study a discrete-time model for the spread of information in a graph, motivated by the idea that people believe a story when they learn of it from two different origins. Similar to the burning number, in this problem, information spreads in rounds and a new source can appear in each round. For a graph , we are interested in , the minimum number of rounds until the information has spread to all vertices of graph . We are also interested in finding , the minimum number of sources necessary so that the information spreads to all vertices of in rounds. In addition to general results, we find and for the classes of spiders and wheels and show that their behavior differs with respect to these two parameters. We also provide examples and prove upper bounds for these parameters for Cartesian products of graphs.
- 28 December 2023
- Published by Elsevier in Discrete Mathematics
- Vol. 347 (4)
Split graphs and block representations
- 28 December 2023
- Published by Elsevier in Discrete Mathematics
- Vol. 347 (4)
Split graphs and block representations
- Open Access
Split graphs and Block Representations
In this paper, we study split graphs and related classes of graphs from the perspective of their sequence of vertex degrees and an associated lattice under majorization. Following the work of Merris in 2003, we define blocks $[\alpha(\pi)|\beta(\pi)]$, where $\pi$ is the degree sequence of a graph, and $\alpha(\pi)$ and $\beta(\pi)$ are sequences arising from $\pi$. We use the block representation $[\alpha(\pi)|\beta(\pi)]$ to characterize membership in each of the following classes: unbalanced split graphs, balanced split graphs, pseudo-split graphs, and three kinds of Nordhaus-Gaddum graphs (defined by Collins and Trenk in 2013). As in Merris' work, we form a poset under the relation majorization in which the elements are the blocks $[\alpha(\pi)|\beta(\pi)]$ representing split graphs with a fixed number of edges. We partition this poset in several interesting ways using what we call amphoras, and prove upward and downward closure results for blocks arising from different families of graphs. Finally, we show that the poset becomes a lattice when a maximum and minimum element are added, and we prove properties of the meet and join of two blocks.Open AccessSplit graphs and Block Representations
In this paper, we study split graphs and related classes of graphs from the perspective of their sequence of vertex degrees and an associated lattice under majorization. Following the work of Merris in 2003, we define blocks $[\alpha(\pi)|\beta(\pi)]$, where $\pi$ is the degree sequence of a graph, and $\alpha(\pi)$ and $\beta(\pi)$ are sequences arising from $\pi$. We use the block representation $[\alpha(\pi)|\beta(\pi)]$ to characterize membership in each of the following classes: unbalanced split graphs, balanced split graphs, pseudo-split graphs, and three kinds of Nordhaus-Gaddum graphs (defined by Collins and Trenk in 2013). As in Merris' work, we form a poset under the relation majorization in which the elements are the blocks $[\alpha(\pi)|\beta(\pi)]$ representing split graphs with a fixed number of edges. We partition this poset in several interesting ways using what we call amphoras, and prove upward and downward closure results for blocks arising from different families of graphs. Finally, we show that the poset becomes a lattice when a maximum and minimum element are added, and we prove properties of the meet and join of two blocks. - 9 August 2022
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 38 (5) , 1-11
Dimension of Restricted Classes of Interval Orders
- 9 August 2022
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 38 (5) , 1-11
Dimension of Restricted Classes of Interval Orders
- Open Access
Dimension of Restricted Classes of Interval Orders
Rabinovitch showed in 1978 that the interval orders having a representation consisting of only closed unit intervals have order dimension at most 3. This article shows that the same dimension bound applies to two other classes of posets: those having a representation consisting of unit intervals (but with a mixture of open and closed intervals allowed) and those having a representation consisting of closed intervals with lengths in $\{0,1\}$.Open AccessDimension of Restricted Classes of Interval Orders
Rabinovitch showed in 1978 that the interval orders having a representation consisting of only closed unit intervals have order dimension at most 3. This article shows that the same dimension bound applies to two other classes of posets: those having a representation consisting of unit intervals (but with a mixture of open and closed intervals allowed) and those having a representation consisting of closed intervals with lengths in $\{0,1\}$. - 18 October 2021
- Published by Springer Nature in Order
- Vol. 39 (3) , 361-380
The Distinguishing Number and Distinguishing Chromatic Number for Posets
- 18 October 2021
- Published by Springer Nature in Order
- Vol. 39 (3) , 361-380
The Distinguishing Number and Distinguishing Chromatic Number for Posets
- Open Access
Product throttling for power domination
The product power throttling number of a graph is defined to study product throttling for power domination. The domination number of a graph is an upper bound for its product power throttling number. It is established that the two parameters are equal for certain families including paths, cycles, complete graphs, unit interval graphs, and grid graphs (on the plane, cylinder, and torus). Families of graphs for which the product power throttling number is less than the domination number are also exhibited. Graphs with extremely high or low product power throttling number are characterized and bounds on the product power throttling number are established.
Open AccessProduct throttling for power domination
The product power throttling number of a graph is defined to study product throttling for power domination. The domination number of a graph is an upper bound for its product power throttling number. It is established that the two parameters are equal for certain families including paths, cycles, complete graphs, unit interval graphs, and grid graphs (on the plane, cylinder, and torus). Families of graphs for which the product power throttling number is less than the domination number are also exhibited. Graphs with extremely high or low product power throttling number are characterized and bounds on the product power throttling number are established.
- Open Access
The distinguishing number and distinguishing chromatic number for posets
In this paper we introduce the concepts of the distinguishing number and the distinguishing chromatic number of a poset. For a distributive lattice $L$ and its set $Q_L$ of join-irreducibles, we use classic lattice theory to show that any linear extension of $Q_L$ generates a distinguishing 2-coloring of $L$. We prove general upper bounds for the distinguishing chromatic number and particular upper bounds for the Boolean lattice and for divisibility lattices. In addition, we show that the distinguishing number of any twin-free Cohen-Macaulay planar lattice is at most 2.Open AccessThe distinguishing number and distinguishing chromatic number for posets
In this paper we introduce the concepts of the distinguishing number and the distinguishing chromatic number of a poset. For a distributive lattice $L$ and its set $Q_L$ of join-irreducibles, we use classic lattice theory to show that any linear extension of $Q_L$ generates a distinguishing 2-coloring of $L$. We prove general upper bounds for the distinguishing chromatic number and particular upper bounds for the Boolean lattice and for divisibility lattices. In addition, we show that the distinguishing number of any twin-free Cohen-Macaulay planar lattice is at most 2. - 1 August 2019
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 267, 52-63
Interval orders with two interval lengths
- 1 August 2019
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 267, 52-63
Interval orders with two interval lengths
- 13 August 2018
- Published by Springer Nature in Order
- Vol. 36 (2) , 313-333
Tolerance Orders of Open and Closed Unit Intervals
- 13 August 2018
- Published by Springer Nature in Order
- Vol. 36 (2) , 313-333
Tolerance Orders of Open and Closed Unit Intervals