The Detour Polynomials of Ladder Graphs

Section: Research Paper
Issue
Vol. 9 No. 1 (2012): Volume 9 Issue 1
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.

Keywords:

Detour distance, Detour index, Detour polynomials, Ladder graphs

Authors

Ali Aziz Ali

Academic Professor University of Mosul, Mosul, Iraq

Gashaw A. Muhammed-Saleh

College of Science University of Salahaddin, Erbil, Iraq

Identifiers

DOI: 10.33899/csmj.2012.163677

Download this PDF file
PDF

Statistics

How to Cite

The Detour Polynomials of Ladder Graphs. (2012). 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.

How to Cite

The Detour Polynomials of Ladder Graphs. (2012). AL-Rafidain Journal of Computer Sciences and Mathematics, 9(1), 139-146. https://doi.org/10.33899/csmj.2012.163677