Contents

Ars Combinatoria

  • Research article

On the Szeged Index of some Benzenoid Graphs Applicable in Nanostructures

H. Yousefi-Azari1, A.R. Ashrafi2,3, N. Sedigh1
1School of Mathematics, Statistics and Computer Science, University of Tehran, Tehran LR. Iran
2Department of Mathematics, Faculty of Setence, University of Kashan, Kashan 87317-51167, LR. Iran
3School of Mathematics, Institute for Research in Fundamental Sciences (IPM, P.O, Box: 19395-5746, Tehran, Iran
  • Published: 31/01/2009

Abstract

The Szeged index of a graph \(G\) is defined as \(\text{Sz}(G) = \sum_{e=uv \in E(G)} N_u(e|G) N_v(e|G)\), where \(N_u(e|G)\) is the number of vertices of \(G\) lying closer to \(u\) than to \(v\) and \(N_v(e|G)\) is the number of vertices of \(G\) lying closer to \(v\) than to \(u\). In this article, the Szeged index of some hexagonal systems applicable in nanostructures is computed.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
H. Yousefi-Azari, A.R. Ashrafi, N. Sedigh. On the Szeged Index of some Benzenoid Graphs Applicable in Nanostructures[J], Ars Combinatoria, Volume 090. 55-64. .