The Detour Polynomials of Ladder Graphs

Section: Research Paper
Issue
Vol. 9 No. 1 (2012): Volume 9 Issue 1
Published
Jun 8, 2012
Pages
139-146

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.

Authors

Ali Aziz Ali

Academic Professor University of Mosul, Mosul, Iraq

Gashaw A. Muhammed-Saleh

College of Science University of Salahaddin, Erbil, Iraq

Identifiers

https://doi.org/10.33899/csmj.2012.163677%20
Download this PDF file
PDF

Statistics

How to Cite

Aziz Ali, A., & A. Muhammed-Saleh, G. (2012). The Detour Polynomials of Ladder Graphs. AL-Rafidain Journal of Computer Sciences and Mathematics, 9(1), 139–146. https://doi.org/10.33899/csmj.2012.163677
Copyright and Licensing
Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.