|
|||||
|
|
Box-threshold graphs |
|
| Authors: | Uri N. Peled Bruno Simeone |
| Abstract: | A graph is called box-threshold when all pairs of vertices with incomparable neighborhoods have the same degree. Several properties of box-threshold graphs, generalizing properties of threshold graphs, are proved. A transportation model with priority constraints is used to characterize their degree sequences. Further characterizations are given using the concept of the frame of a graph. |
| Keywords: | |