Distance in stratified graphs
Gary Chartrand, Lisa Hansen, Reza Rashidi, Naveed Sherwani (2000)
Czechoslovak Mathematical Journal
Similarity:
A graph is stratified if its vertex set is partitioned into classes, called strata. If there are strata, then is -stratified. These graphs were introduced to study problems in VLSI design. The strata in a stratified graph are also referred to as color classes. For a color in a stratified graph , the -eccentricity of a vertex of is the distance between and an -colored vertex furthest from . The minimum -eccentricity among the vertices of is the -radius of ...