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.
Recommendations
Cites work
- Eccentric sequences in graphs
- Graph Bipartization and via minimization
- Graphs with specified radius and diameter
- scientific article; zbMATH DE number 3908466 (Why is no real title available?)
- scientific article; zbMATH DE number 802995 (Why is no real title available?)
- On graphs containing a given graph as center
- The dissimilarity characteristic of Husimi trees
Cited in
(13)- A survey of stratified domination in graphs
- Stratification and domination in graphs
- Twin subgraphs and core-semiperiphery-periphery structures
- Stratification and domination in graphs. II
- \(F_3\)-domination problem of graphs
- Algorithmic aspect of stratified domination in graphs
- Stratification and domination in graphs with minimum degree two
- Uniform k-stratified graphs
- Stratidistance in stratified graphs
- scientific article; zbMATH DE number 1145910 (Why is no real title available?)
- On a problem concerning stratified graphs.
- scientific article; zbMATH DE number 1792611 (Why is no real title available?)
- Eccentric sequences in stratified graphs
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)