ScholarLens Back to search
2008•University of Zagreb University Computing Centre (SRCE)Open access

The Edge Szeged Index of Product Graphs

M. H. Khalifeh, H. Yousefi-Azari, Али Реза Ашрафи, İvan Gutman

Open full text 62 citations

Abstract

The edge Szeged index of a molecular graph G is defined as the sum of products m u (e|G)m v (e|G) over all edges e = uv of G, where m u (e|G) is the number of edges whose distance to vertex u is smaller than the distance to vertex v, and where m v (e|G) is defined analogously.The aim of this paper is to compute the edge Szeged index of the Cartesian product of graphs.As a consequence of our result, the edge Szeged index of Hamming graphs and C 4 -nanotubes are computed.

Open-access reader

About this research paper

What this paper is about

The edge Szeged index of a molecular graph G is defined as the sum of products m u (e|G)m v (e|G) over all edges e = uv of G, where m u (e|G) is the number of edges whose distance to vertex u is smaller than the distance to vertex v, and where m v (e|G) is defined analogously.The aim of this paper is to compute the edge Szeged index of the Cartesian product of graphs.As a consequence of our result, the edge Szeged index of Hamming graphs and C 4 -nanotubes are computed.

Why it matters

OpenAlex reports 62 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The edge Szeged index of a molecular graph G is defined as the sum of products m u (e|G)m v (e|G) over all edges e = uv of G, where m u (e|G) is the number of edges whose distance to vertex u is smaller than the distance to vertex v, and where m v (e|G) is defined analogously.The aim of this paper is to compute the edge Szeged index of the Cartesian product of graphs.As a consequence of our result, the edge Szeged index of Hamming graphs and C 4 -nanotubes are computed.

Key concepts: Cartesian product, Combinatorics, Vertex (graph theory), Mathematics, Enhanced Data Rates for GSM Evolution, Index (typography), Graph, Product (mathematics)

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
The Edge Szeged Index of Product Graphs — Research Paper | ScholarLens