The detour polynomials of ladder graphs

الملخص EN

The detour distance D (u, v) between two distinct vertices u and v of a connected graph G is the length of a longest u-v path inG.

The detour index dd (G) of G is defined by { , } ( , ) u v åD u v, and the detour polynomial of G is ( , ) { , } ( ; ) D u v u v D G x = å x .

The detour indices and detour polynomials of some ladder graphs are obtained in this paper.