The Detour Polynomials of Ladder Graphs
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.
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | Arabic |
| Published: |
Mosul University
2012-07-01
|
| Series: | Al-Rafidain Journal of Computer Sciences and Mathematics |
| Subjects: | |
| Online Access: | https://csmj.mosuljournals.com/article_163677_3b5ce53b049b75e94089e98e650b8cc1.pdf |