(a,b)-Panconnected graph

[math]\displaystyle{ (a,b) }[/math]-Panconnected graph --- [math]\displaystyle{ (a,b) }[/math]-пансвязный граф.

Let [math]\displaystyle{ a,b }[/math] be integers and [math]\displaystyle{ a \leq i \leq b }[/math]. [math]\displaystyle{ G }[/math] is called [math]\displaystyle{ (a,b) }[/math]-panconnected, if there exists a path [math]\displaystyle{ P_{i}[u, v] }[/math] between each pair of distinct vertices [math]\displaystyle{ u, v }[/math] of [math]\displaystyle{ G }[/math].