#### Filter Results:

#### Publication Year

1993

2013

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

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
- ›