Maximum values of the Sombor-index-like graph invariants of connected graphs

05/04/2023
by   Milan Bašić, et al.
0

A set of novel vertex-degree-based invariants, similar to the Sombor-index, was introduced by Gutman, denoted by SO_1, SO_2, …,SO_6. These invariants were constructed through geometric reasoning based on a new graph invariant framework. Motivated by proposed open problems in [Z. Tang, Q. Li, H. Deng, Trees with Extremal Values of the Sombor-Index-Like Graph Invariants, MATCH Commun. Math. Comput. Chem. 90 (2023) 203-222], we have found the maximum values of SO_5 and SO_6 in the set of molecular trees with a given number of vertices, respectively, and we have found the maximum value of SO_5 in the set of connected graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/07/2019

Graphs with the second and third maximum Wiener index over the 2-vertex connected graphs

Wiener index, defined as the sum of distances between all unordered pair...
research
08/30/2018

Maximum Eccentric Connectivity Index for Graphs with Given Diameter

The eccentricity of a vertex v in a graph G is the maximum distance betw...
research
12/21/2017

PHOEG Helps Obtaining Extremal Graphs

Extremal Graph Theory aims to determine bounds for graph invariants as w...
research
06/25/2018

Finding models through graph saturation

We give a procedure that can be used to automatically satisfy invariants...
research
01/15/2019

On Extremal Graphs of Weighted Szeged Index

An extension of the well-known Szeged index was introduced recently, nam...
research
09/16/2019

Learning Invariants through Soft Unification

Human reasoning involves recognising common underlying principles across...
research
08/21/2020

Optimal algorithm for computing Steiner 3-eccentricities of trees

The Steiner k-eccentricity of a vertex v of a graph G is the maximum Ste...

Please sign up or login with your details

Forgot password? Click here to reset