Distance in stratified graphs.

From MaRDI portal





A stratified graph is an ordered pair \((G,S)\), where \(G\) is an undirected graph and \(S\) is a partition of its vertex set \(V(G)\) into classes called strata. For any stratum \(X\) the concepts analogous to the basic concepts concerning distance may be defined, namely \(X\)-eccentricity, \(X\)-radius, \(X\)-diameter, \(X\)-center, \(X\)-periphery. These concepts are studied in the paper. The study of stratified graphs is motivated on the one hand by VLSI designs, on the other hand by needs of sociology and politology.











This page was built for publication: Distance in stratified graphs.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4457237)