A395986 Minimum transmission of a connected cubic graph on 2n vertices.

6, 21, 44, 75, 126, 189, 264, 351, 450, 573, 708, 871

Offset

2,1

Comments

Here, transmission means the Wiener index, the sum of distances between all unordered pairs of vertices.

The terms a(3)-a(11) are the entries in the w_{n,3} row of Table 1 of Knor, Škrekovski, and Tepeh (2019).

Links

Table of n, a(n) for n=2..13.

M. Knor, R. Škrekovski and A. Tepeh, Chemical Graphs with the Minimum Value of Wiener Index, MATCH Commun. Math. Comput. Chem. 81 (2019), 119-132.

Eric Weisstein's World of Mathematics, Transmission-Minimal Regular Graph.

Example

a(2) = 6, attained by the tetrahedral graph K_4.
a(5) = 75, attained by the Petersen graph.
a(12) = 708, attained by the McGee graph.
a(13) = 871, attained by the generalized Petersen Graph GP(13,5) and one other. - Eric W. Weisstein, May 20 2026

Crossrefs

Cf. A395987 (number of transmission-minimal cubic graphs).

Cf. A395988 (minimal transmission for quartic graphs).

Cf. A395989 (number of transmission-minimal quartic graphs).

Sequence in context: A272671 A272684 A180863 * A180857 A119868 A175729

Adjacent sequences: A395983 A395984 A395985 * A395987 A395988 A395989

Keyword

nonn,more

Author

Eric W. Weisstein, May 13 2026

Extensions

a(13) from Eric W. Weisstein, May 20 2026

Status

approved