The Wiener, Eccentric Connectivity and Zagreb Indices of the Hierarchical Product of Graphs
Hossein-Zadeh, S.; Hamzeh, A.; Ashrafi, A.
Serdica Journal of Computing (2012)
- Volume: 6, Issue: 4, page 409-418
- ISSN: 1312-6555
Access Full Article
topAbstract
topHow to cite
topHossein-Zadeh, S., Hamzeh, A., and Ashrafi, A.. "The Wiener, Eccentric Connectivity and Zagreb Indices of the Hierarchical Product of Graphs." Serdica Journal of Computing 6.4 (2012): 409-418. <http://eudml.org/doc/250962>.
@article{Hossein2012,
abstract = {Let G1 = (V1, E1) and G2 = (V2, E2) be two graphs having a distinguished or root vertex, labeled 0. The hierarchical product G2 ⊓ G1
of G2 and G1 is a graph with vertex set V2 × V1. Two vertices y2y1 and x2x1 are adjacent if and only if y1x1 ∈ E1 and y2 = x2; or y2x2 ∈ E2 and y1 = x1 = 0. In this paper, the Wiener, eccentric connectivity and Zagreb indices of this new operation of graphs are computed. As an application, these topological indices for a class of alkanes are computed. ACM Computing Classification System (1998): G.2.2, G.2.3.The research of this paper is partially supported by the University of Kashan under grant no 159020/12.},
author = {Hossein-Zadeh, S., Hamzeh, A., Ashrafi, A.},
journal = {Serdica Journal of Computing},
keywords = {Wiener Index; Eccentric Connectivity Index; First Zagreb Index; First Zagreb Co-index; Wiener index; eccentric connectivity index; first Zagreb index},
language = {eng},
number = {4},
pages = {409-418},
publisher = {Institute of Mathematics and Informatics Bulgarian Academy of Sciences},
title = {The Wiener, Eccentric Connectivity and Zagreb Indices of the Hierarchical Product of Graphs},
url = {http://eudml.org/doc/250962},
volume = {6},
year = {2012},
}
TY - JOUR
AU - Hossein-Zadeh, S.
AU - Hamzeh, A.
AU - Ashrafi, A.
TI - The Wiener, Eccentric Connectivity and Zagreb Indices of the Hierarchical Product of Graphs
JO - Serdica Journal of Computing
PY - 2012
PB - Institute of Mathematics and Informatics Bulgarian Academy of Sciences
VL - 6
IS - 4
SP - 409
EP - 418
AB - Let G1 = (V1, E1) and G2 = (V2, E2) be two graphs having a distinguished or root vertex, labeled 0. The hierarchical product G2 ⊓ G1
of G2 and G1 is a graph with vertex set V2 × V1. Two vertices y2y1 and x2x1 are adjacent if and only if y1x1 ∈ E1 and y2 = x2; or y2x2 ∈ E2 and y1 = x1 = 0. In this paper, the Wiener, eccentric connectivity and Zagreb indices of this new operation of graphs are computed. As an application, these topological indices for a class of alkanes are computed. ACM Computing Classification System (1998): G.2.2, G.2.3.The research of this paper is partially supported by the University of Kashan under grant no 159020/12.
LA - eng
KW - Wiener Index; Eccentric Connectivity Index; First Zagreb Index; First Zagreb Co-index; Wiener index; eccentric connectivity index; first Zagreb index
UR - http://eudml.org/doc/250962
ER -
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.