#### Filter Results:

- Full text PDF available (20)

#### Publication Year

1998

2018

- This year (2)
- Last 5 years (19)
- Last 10 years (25)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Timothy D. LeSaulnier, Christopher Stocker, Paul S. Wenger, Douglas B. West
- Electr. J. Comb.
- 2010

A rainbow subgraph of an edge-colored graph is a subgraph whose edges have distinct colors. The color degree of a vertex v is the number of different colors on edges incident to v. Wang and Li… (More)

- Stephen G. Hartke, Jennifer Vandenbussche, Paul S. Wenger
- SIAM J. Discrete Math.
- 2007

A bar visibility representation of a graph G is a collection of horizontal bars in the plane corresponding to the vertices of G such that two vertices are adjacent if and only if the corresponding… (More)

- Joshua N. Cooper, John Lenz, Timothy D. LeSaulnier, Paul S. Wenger, Douglas B. West
- Graphs and Combinatorics
- 2012

For a fixed graph H, a graph G is uniquely H-saturated if G does not contain H, but the addition of any edge from G to G completes exactly one copy of H. Using a combination of algebraic methods and… (More)

- Michael D. Barrus, Michael Ferrara, Jennifer Vandenbussche, Paul S. Wenger
- Journal of Graph Theory
- 2017

Inspired by a 1987 result of Hanson and Toft [Edge-colored saturated graphs, J. Graph Theory 11 (1987), 191–196] and several recent results, we consider the following saturation problem for… (More)

- Timothy D. LeSaulnier, Noah Prince, Paul S. Wenger, Douglas B. West, Pratik Worah
- SIAM J. Discrete Math.
- 2013

Let G be a weighted graph in which each vertex initially has weight 1. A total acquisition move transfers all the weight from a vertex u to a neighboring vertex v, under the condition that before the… (More)

- Eric Peterson, Paul S. Wenger
- Graphs and Combinatorics
- 2017

A visibility representation of a graph G is an assignment of the vertices of G to geometric objects such that vertices are adjacent if and only if their corresponding objects are “visible” each… (More)

- Paul S. Wenger
- Discrete Applied Mathematics
- 2014

Let G be a vertex-weighted graph in which each vertex has weight 1. Given a vertexu with positive weight and a neighbor v whose weight is at least the weight on u, a fractional acquisition move… (More)

- Nathan D. Cahill, Harmeet Singh, +6 authors Andrew M. Michael
- ArXiv
- 2016

Functional connectivity analysis yields powerful insights into our understanding of the human brain. Group-wise functional community detection aims to partition the brain into clusters, or… (More)

Laplacian Eigenmaps (LE) and Schroedinger Eigenmaps (SE) are effective dimensionality reduction algorithms that are capable of integrating both the spatial and spectral information inherent in a… (More)

- Michael Ferrara, Ellen Gethner, Stephen G. Hartke, Derrick Stolee, Paul S. Wenger
- Eur. J. Comb.
- 2018

Given a group Γ acting on a set X, a k-coloring φ : X → {1, . . . , k} of X is distinguishing with respect to Γ if the only γ ∈ Γ that fixes φ is the identity action. The distinguishing number of the… (More)