Joshua Douglass Laison
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
Research Subjects
Research Interests
Joshua Douglass Laison has a total of 33 co-authors. Here are the top co-authors by number of shared publications:
- Colin Starr
Department of Mathematics, Willamette University, Salem, USA
2 shared publications Breeann Flesch
Department of Mathematics & Statistics, University of North Dakota, Grand Forks, USA
1 shared publication- Breeann M. Flesch
Columbia University Western Oregon University Willamette University Willamette University University of Oregon
1 shared publication - Cam McLeman
University of Michigan–Flint
1 shared publication Caroline Daugherty
Operations Research Center, Massachusetts Institute of Technology, Cambridge, USA
1 shared publication- Charles Dunn
Linfield College
1 shared publication
Latest Publications
- 13 March 2025
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 41 (2) , 1-24
Veto Interval Graphs and Variations
- 13 March 2025
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 41 (2) , 1-24
Veto Interval Graphs and Variations
- Open Access
- 1 January 2024
- Published by Georgia Southern University in Theory and Applications of Graphs
- Vol. 11 (1) , 1-14
Approval Gap of Weighted k-Majority Tournaments
A $k$-majority tournament $T$ on a finite set of vertices $V$ is defined by a set of $2k-1$ linear orders on $V$, with an edge $u \to v$ in $T$ if $u>v$ in a majority of the linear orders. We think of the linear orders as voter preferences and the vertices of $T$ as candidates, with an edge $u \to v$ in $T$ if a majority of voters prefer candidate $u$ to candidate $v$. In this paper we introduce weighted $k$-majority tournaments, with each edge $u \to v$ weighted by the number of voters preferring $u$. We define the maximum approval gap $\gamma_w(T)$, a measure by which any dominating set of $T$ beats the next most popular candidate. This parameter is analogous to previous work on the size of minimum dominating sets of (unweighted) $k$-majority tournaments. We prove that $k/2 \leq \gamma_w(T) \leq 2k-1$ for any weighted $k$-majority tournament $T$, and construct tournaments with $\gamma_w(T)=q$ for any rational number $k/2 \leq q \leq 2k-1$. We also consider the minimum number of vertices $m(q,k)$ in a $k$-majority tournament with $\gamma_w(T)=q$.- 1 January 2024
- Published by Georgia Southern University in Theory and Applications of Graphs
- Vol. 11 (1) , 1-14
Open AccessApproval Gap of Weighted k-Majority Tournaments
A $k$-majority tournament $T$ on a finite set of vertices $V$ is defined by a set of $2k-1$ linear orders on $V$, with an edge $u \to v$ in $T$ if $u>v$ in a majority of the linear orders. We think of the linear orders as voter preferences and the vertices of $T$ as candidates, with an edge $u \to v$ in $T$ if a majority of voters prefer candidate $u$ to candidate $v$. In this paper we introduce weighted $k$-majority tournaments, with each edge $u \to v$ weighted by the number of voters preferring $u$. We define the maximum approval gap $\gamma_w(T)$, a measure by which any dominating set of $T$ beats the next most popular candidate. This parameter is analogous to previous work on the size of minimum dominating sets of (unweighted) $k$-majority tournaments. We prove that $k/2 \leq \gamma_w(T) \leq 2k-1$ for any weighted $k$-majority tournament $T$, and construct tournaments with $\gamma_w(T)=q$ for any rational number $k/2 \leq q \leq 2k-1$. We also consider the minimum number of vertices $m(q,k)$ in a $k$-majority tournament with $\gamma_w(T)=q$. - 20 September 2023
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 46 (3) , 1-22
Area, perimeter, height, and width of rectangle visibility graphs
- 20 September 2023
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 46 (3) , 1-22
Area, perimeter, height, and width of rectangle visibility graphs
- 27 June 2023
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 39 (4) , 1-16
Intersection Graphs of Maximal Sub-polygons of k-Lizards
- 27 June 2023
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 39 (4) , 1-16
Intersection Graphs of Maximal Sub-polygons of k-Lizards
- 24 October 2018
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 255, 334-338
Prime power and prime product distance graphs
- 24 October 2018
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 255, 334-338
Prime power and prime product distance graphs
- Open Access
Critical Pebbling Numbers of Graphs
We define three new pebbling parameters of a connected graph $G$, the $r$-, $g$-, and $u$-critical pebbling numbers. Together with the pebbling number, the optimal pebbling number, the number of vertices $n$ and the diameter $d$ of the graph, this yields 7 graph parameters. We determine the relationships between these parameters. We investigate properties of the $r$-critical pebbling number, and distinguish between greedy graphs, thrifty graphs, and graphs for which the $r$-critical pebbling number is $2^d$.Open AccessCritical Pebbling Numbers of Graphs
We define three new pebbling parameters of a connected graph $G$, the $r$-, $g$-, and $u$-critical pebbling numbers. Together with the pebbling number, the optimal pebbling number, the number of vertices $n$ and the diameter $d$ of the graph, this yields 7 graph parameters. We determine the relationships between these parameters. We investigate properties of the $r$-critical pebbling number, and distinguish between greedy graphs, thrifty graphs, and graphs for which the $r$-critical pebbling number is $2^d$. - Open Access
Weighted pebbling numbers on graphs
We expand the theory of pebbling to graphs with weighted edges. In a weighted pebbling game, one player distributes a set amount of weight on the edges of a graph and his opponent chooses a target vertex and places a configuration of pebbles on the vertices. Player one wins if, through a series of pebbling moves, he can move at least one pebble to the target. A pebbling move of p pebbles across an edge with weight w leaves the floor of pw pebbles on the next vertex. We find the weighted pebbling numbers of stars, graphs with at least 2|V|-1 edges, and trees with given targets. We give an explicit formula for the minimum total weight required on the edges of a length-2 path, solvable with p pebbles and exhibit a graph which requires an edge with weight 1/3 in order to achieve its weighted pebbling number.
Open AccessWeighted pebbling numbers on graphs
We expand the theory of pebbling to graphs with weighted edges. In a weighted pebbling game, one player distributes a set amount of weight on the edges of a graph and his opponent chooses a target vertex and places a configuration of pebbles on the vertices. Player one wins if, through a series of pebbling moves, he can move at least one pebble to the target. A pebbling move of p pebbles across an edge with weight w leaves the floor of pw pebbles on the next vertex. We find the weighted pebbling numbers of stars, graphs with at least 2|V|-1 edges, and trees with given targets. We give an explicit formula for the minimum total weight required on the edges of a length-2 path, solvable with p pebbles and exhibit a graph which requires an edge with weight 1/3 in order to achieve its weighted pebbling number.
- 16 September 2010
- Published by Elsevier in Discrete Mathematics
- Vol. 310 (23) , 3413-3416
Subspace intersection graphs
- 16 September 2010
- Published by Elsevier in Discrete Mathematics
- Vol. 310 (23) , 3413-3416
Subspace intersection graphs
- 27 April 2010
- Published by Springer Nature in Order
- Vol. 27 (2) , 163-175
Triangle, Parallelogram, and Trapezoid Orders
- 27 April 2010
- Published by Springer Nature in Order
- Vol. 27 (2) , 163-175
Triangle, Parallelogram, and Trapezoid Orders
- 3 December 2009
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 44 (1) , 223-244
Obstacle Numbers of Graphs
- 3 December 2009
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 44 (1) , 223-244
Obstacle Numbers of Graphs