The restricted detour polynomials of a hexagonal chain and a ladder graph
Abstract
The restricted detour distance D*(u,v) between two vertices u and v of a connected graph G is the length of a longest u-v path P in G such that <V(P)>=P . The restricted detour polynomial of G, is a graph distance polynomial defined on restricted detour distance. The restricted detour polynomials and restricted detour indices of hexagonal graphs and ladder graphs are obtained in this paper.
Copyright © 2012 A. A. Ali, A. Mohammed-Saleh. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Cite this article
A. A. Ali, A. Mohammed-Saleh, The restricted detour polynomials of a hexagonal chain and a ladder graph, J. Math. Comput. Sci. 2 (2012), 1622–1633.
BibTeX
@article{Ali2012,
author = {Ali, A. A. and Mohammed-Saleh, A.},
title = {The restricted detour polynomials of a hexagonal chain and a ladder graph},
journal = {J. Math. Comput. Sci.},
volume = {2},
year = {2012},
pages = {1622--1633},
doi = {}
}