On the graphs with maximum distance or $k$-diameter

In: Mathematica Slovaca, vol. 55, no. 2

Wayne Goddard - Christine S. Swart - Henda C. Swart

Detaily:

Rok, strany: 2005, 131 - 139

O článku:

The distance of a set of vertices is the sum of the distances between pairs of vertices in the set. We define the $k$@-diameter of a graph as the maximum distance of a set of $k$ vertices; so the $2$@-diameter is the normal diameter and the $n$@-diameter, where $n$ is the order, is the distance of the graph. We complete the characterization of graphs with maximum distance given the order and size. We also determine the maximum size of a graph with given order and $3$@-diameter.

Ako citovať:

ISO 690:

Goddard, W., Swart, C., Swart, H. 2005. On the graphs with maximum distance or $k$-diameter. In Mathematica Slovaca, vol. 55, no.2, pp. 131-139. 0139-9918.

APA:

Goddard, W., Swart, C., Swart, H. (2005). On the graphs with maximum distance or $k$-diameter. Mathematica Slovaca, 55(2), 131-139. 0139-9918.