6 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Kutztown UniversityUS11 papers
- Carnegie Mellon UniversityUS2 papers
- Hastings CollegeUS2 papers
- Mount Holyoke CollegeUS2 papers
- Tufts UniversityUS2 papers
- University of California, DavisUS2 papers
- University of California, Santa BarbaraUS2 papers
- Appalachian State UniversityUS1 paper
- Auburn UniversityUS1 paper
- Biola UniversityUS1 paper
- Bryn Mawr CollegeUS1 paper
- College of IdahoUS1 paper
5 papers · 1 filter
Paired -to- disjoint path covers in bipartite transposition-like graphs
Anna Coleman, Gabrielle Fischberg, Charles Gong +2
A paired -to- disjoint path cover of a graph is a collection of pairwise disjoint path subgraphs such that each has prescribed vertices a…
Probabilistic chip-collecting games with modulo winning conditions
Joshua Harrington, Xuwen Hua, Xufei Liu +3
Let , , and be integers with . In a certain two-player probabilistic chip-collecting game, Alice tosses a coin to determine whether she collects chips or …
Distance in Latin Squares
Omar Aceval, Paige Beidelman, Jieqi Di +4
A Latin square of order is an array which contains distinct symbols exactly once in each row and column. We define the adjacent distance between two adjacent ce…
Sum index and difference index of graphs
Joshua Harrington, Eugene Henninger-Voss, Kedjar Karhadkar +2
Let be a nonempty simple graph with a vertex set and an edge set . For every injective vertex labeling , there are two induced edge labelings,…
On the Domination Number of Permutation Graphs and an Application to Strong Fixed Points
Theresa Baren, Michael Cory, Mia Friedberg +6
A permutation graph is a simple graph with vertices corresponding to the elements of and an edge between and when and are inverted in . A set of vertic…