The Detour Polynomials of Ladder Graphs
AL-Rafidain Journal of Computer Sciences and Mathematics,
2012, Volume 9, Issue 1, Pages 139-146
10.33899/csmj.2012.163677
Abstract
The detour distance between two distinct vertices and of a connected graph is the length of a longest path in. The detour index of is defined by, and the detour polynomial of is . The detour indices and detour polynomials of some ladder graphs are obtained in this paper.- Article View: 48
- PDF Download: 84