1 citations · 1 across the 10 of their papers we have counts for
11 papers
Corner Rectangle Visibility Graphs
Juni L. DeYoung, Joshua D. Laison, Junyi Li +1
We introduce corner rectangle visibility graphs (CRVGs), a combination of two geometrically defined classes of graphs: rectangle visibility graphs (RVGs) and rectangle-of-influence…
Area, Perimeter, Height, and Width of Rectangle Visibility Graphs
John S. Caughman, Charles L. Dunn, Joshua D. Laison +2
A rectangle visibility graph (RVG) is represented by assigning to each vertex a rectangle in the plane with horizontal and vertical sides in such a way that edges in the graph corr…
Finite Prime Distance Graphs and 2-Odd Graphs
Joshua D. Laison, Colin Starr, Andrea Walker
A graph is a prime distance graph (respectively, a 2-odd graph) if its vertices can be labeled with distinct integers such that for any two adjacent vertices, the difference of…
Intersection Graphs of Maximal Sub-polygons of -Lizards
Caroline Daugherty, Joshua D. Laison, Rebecca Robinson +1
We introduce -maximal sub-polygon graphs (-MSP graphs), the intersection graphs of maximal polygons contained in a polygon with sides parallel to a regular -gon. We prove…
Approval Gap of Weighted k-Majority Tournaments
Jeremy Coste, Breenn Flesch, Joshua D. Laison +2
A -majority tournament on a finite set of vertices is defined by a set of linear orders on , with an edge in if in a majority of the linear…
Fixing Numbers of Graphs and Groups
Courtney R. Gibbons, Joshua D. Laison
The fixing number of a graph is the smallest cardinality of a set of vertices such that only the trivial automorphism of fixes every vertex in . The fixing set of a…