1 citations · 1 across the 5 of their papers we have counts for
5 papers
Counting Colored Trees
Stoyan Dimitrov, Nathan Fox, Kimberly Hadaway +2
We consider the enumeration of plane trees (rooted ordered trees) whose vertices are colored according to a specific coloring rule that prescribes which possible pairs of colors ca…
Total Prime Labelings of Various Graphs
N. Bradley Fox, Joseph Spaeth
A total prime labeling of a graph of order is an extension of a prime labeling in which we distinctly label the vertices and edges. The goal of the labeling is for adjacent ver…
Closed Neighborhood Balanced Coloring of Graphs
K. L. Collins, M. Bowie, N. B. Fox +7
A coloring of the vertex set of a graph using the colors red and blue is a closed neighborhood balanced coloring if for each vertex there are an equal number of red and blue vertic…
Elated Numbers
N. Bradley Fox, Nathan H. Fox, Helen G. Grundman +3
For a base , the -elated function, , maps a positive integer written in base to the product of its leading digit and the sum of the squares of its digits.…
Neighborhood-Prime Labelings of Trees and Other Classes of Graphs
Malori Cloys, N. Bradley Fox
A neighborhood-prime labeling of a graph is a variation of a prime labeling in which the vertices are assigned labels from to such that the of the labels in the…