Bounds on Sombor index of graph operations

Title

Bounds on Sombor index of graph operations

Creator

Sarkar I.; Nanjappa M.; Cangul I.N.

Description

Operations in graph theory have a significant influence in the theoretical and application aspect of the domain. Topological indices serve as a crucial component in chemical graph theory linked with some molecular structure. Recently, Gutman initiated the study on the Sombor index. In this paper, the computation of some bounds for Sombor index of graph operation notably join, cartesian product, corona product, lexicographic product, tensor product and strong product is carried out. The computation has been utilized to determine the upper bounds of the index for the specified graph operations for some standard graphs like the path and cycle graphs. 2025 World Scientific Publishing Company.

Source

Discrete Mathematics, Algorithms and Applications

Date

2025-01-01

Publisher

World Scientific

Subject

first general Zagreb index; general sum-connectivity index; graph operations; Sombor index

Coverage

Sarkar I., Department of Mathematics, Alliance University, Bengaluru, 562106, India; Nanjappa M., Department of Mathematics, Christ University, Bengaluru, 560029, India; Cangul I.N., Department of Mathematics, Bursa Uludag University, Gorukle Campus Bursa, Bursa, 16059, Turkey

Rights

Restricted Access

Relation

ISSN: 17938309

Format

Online

Language

English

Type

Article

Identifier

https://doi.org/10.1142/S1793830925500089

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85215868639&doi=10.1142%2fS1793830925500089&partnerID=40&md5=362a27f4204a85cee6e41fa90bb513f1