The Detour Polynomials of Ladder Graphs | ||
| AL-Rafidain Journal of Computer Sciences and Mathematics | ||
| Article 11, Volume 9, Issue 1, June 2012, Pages 139-146 PDF (404.46 K) | ||
| Document Type: Research Paper | ||
| DOI: 10.33899/csmj.2012.163677 | ||
| Authors | ||
| Ali Aziz Ali1; Gashaw A. Muhammed-Saleh2 | ||
| 1Academic Professor University of Mosul, Mosul, Iraq | ||
| 2College of Science University of Salahaddin, Erbil, Iraq | ||
| 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. | ||
| Keywords | ||
| Detour distance; Detour index; Detour polynomials; Ladder graphs | ||
|
Statistics Article View: 200 PDF Download: 246 |
||