Paul S. Wenger

activity

20112018

most citedOn the Sum Neccesary to Ensure that a Degree Sequence is Potentially H-Graphic

2 citations · 5 across the 9 of their papers we have counts for

collaborators

Showing 2017Show all

2 papers · 1 filter

math.CO2017

The Unit Acquisition Number of a Graph

Frederick Johnson, Anna Raleigh, Paul S. Wenger +1

Let $G$ be a graph with nonnegative integer weights. A {\it unit acquisition move} transfers one unit of weight from a vertex to a neighbor that has at least as much weight. The {\…

math.CO2017

List-Distinguishing Cartesian Products of Cliques

Michael Ferrara, Zoltan Furedi, Sogol Jahanbekam +1

The distinguishing number of a graph $G$ , denoted $D (G)$ , is the minimum number of colors needed to produce a coloring of the vertices of $G$ so that every nontrivial isomorphism i…