Diameter in iterated path graphs (Q5936025)
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 1612885
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Diameter in iterated path graphs |
scientific article; zbMATH DE number 1612885 |
Statements
Diameter in iterated path graphs (English)
0 references
2 July 2001
0 references
The path graph \(P_k(G)\) (where \(G\) is a graph and \(k\geq 1\)) was defined as a natural generalization of the line graph of \(G\). The authors study the behavior of \(\text{diam}(P^i_2(G))\) as a function of \(i\), where \(P^i_2(G)\) is the composition \(P_2(P^{i-1}_2(G))\) and \(P^0_2(G)= G\).
0 references
diameter
0 references
path graph
0 references
line graph
0 references
0.813478410243988
0 references
