Computation of Detour Index of TUHC6[2p, q] Nanotubes for Any p and q
The detour d(i, j) between vertices i and j of a graph is the number of edges of the longest path connecting these vertices. The matrix whose (i, j)-entry is the detour between vertices i and j is called the detour matrix.
The half sum D of detours between all pairs of vertices (in a connected graph) is the detour index, i.e., D = (1/2)Σ
j
Σ
i
d(i, j). In this paper, we computed the detour index of TUHC6[2p, q]
nanotubes for any p and q.
Keywords: DETOUR INDEX; TUHC6[2P, Q] NANOTUBES
Document Type: Research Article
Publication date: 01 October 2011
- Journal for Nanoscience and Nanotechnology (JNN) is an international and multidisciplinary peer-reviewed journal with a wide-ranging coverage, consolidating research activities in all areas of nanoscience and nanotechnology into a single and unique reference source. JNN is the first cross-disciplinary journal to publish original full research articles, rapid communications of important new scientific and technological findings, timely state-of-the-art reviews with author's photo and short biography, and current research news encompassing the fundamental and applied research in all disciplines of science, engineering and medicine.
- Editorial Board
- Information for Authors
- Subscribe to this Title
- Terms & Conditions
- Ingenta Connect is not responsible for the content or availability of external websites
- Access Key
- Free content
- Partial Free content
- New content
- Open access content
- Partial Open access content
- Subscribed content
- Partial Subscribed content
- Free trial content