scientific article; zbMATH DE number 3843789
From MaRDI portal
Publication:3313893
Let \(G\) be a graph and \(n\) be a natural number. The \(n\)-step graph \(S_n(G)\) (the \(n\)-path graph \(S'_n(G)\), the distance-\(n\) graph \(T_n(G))\) is the graph with the same vertex set as \(G\) and the edge \(uv\) belongs to it if there is in \(G\) a walk (a path, a geodesic path) of length \(n\) between \(u\) and \(v\). A complete characterization of the graphs \(G\) for which \(S_n(G)=T_n(G)\) or \(S'_n(G)=T_n(G)\) is given. Further the authors investigate the connectivity of the graph \(T_2(G)\).
Recommendations
Cited in
(8)- Switching invariant two-path signed graphs
- Graphs having distance-\(n\) domination number half their order
- Graph equation for line graphs and \(m\)-step graphs
- On Properties of a Graph that Depend on its Distance Function
- Characterizing 2-distance graphs
- On the radius of neighborhood graphs
- Graphs with parity conditions on distances between cut and noncut vertices
- Connectivity of 3-distance graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3313893)