No label defined (Q3313893)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3843789
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3843789 |
Statements
1982
0 references
n-step graph
0 references
distance n-graph
0 references
n-path graph
0 references
geodesic path
0 references
0.7891980409622192
0 references
0.7636991143226624
0 references
0.757462739944458
0 references
0.7466303706169128
0 references
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)\).
0 references