Sul-Young Choi

Learn More
Given a labeling of the vertices and edges of a graph, we define a type of homo-geneity that requires that the neighborhood of every vertex contains the same number of each of the labels. This homogeneity constraint is a generalization of regularity – all such graphs are regular. We consider a specific condition in which both the edge and vertex label sets(More)
  • 1