1 citations · 1 across the 7 of their papers we have counts for
3 papers · 1 filter
Klein cordial trees and odd cyclic cordial friendship graphs
William Q. Erickson, Daniel Herden, Jonathan Meddaugh +7
For a graph and an abelian group , a labeling of the vertices of induces a labeling of the edges via the sum of adjacent vertex labels. Hovey introduced the notion of an…
Vertex-edge marking score of certain triangular lattices
Daniel Herden, Jonathan Meddaugh, Mark Sepanski +8
The vertex-edge marking game is played between two players on a graph, , with one player marking vertices and the other marking edges. The players want to minimize/maximiz…
On the -hull number and infecting times of generalized Petersen graphs
Daniel Herden, Jonathan Meddaugh, Mark Sepanski +8
The -hull number of a graph is the minimum cardinality of an infecting set of vertices that will eventually infect the entire graph under the rule that uninfected nodes become…