Academia.edu no longer supports Internet Explorer.
To browse Academia.edu and the wider internet faster and more securely, please take a few seconds to upgrade your browser.
Symmetry
…
12 pages
1 file
The concept of Sombor index (SO) was recently introduced by Gutman in the chemical graph theory. It is a vertex-degree-based topological index and is denoted by Sombor index SO: SO=SO(G)=∑vivj∈E(G)dG(vi)2+dG(vj)2, where dG(vi) is the degree of vertex vi in G. Here, we present novel lower and upper bounds on the Sombor index of graphs by using some graph parameters. Moreover, we obtain several relations on Sombor index with the first and second Zagreb indices of graphs. Finally, we give some conclusions and propose future work.
2ND INTERNATIONAL CONFERENCE ON MATHEMATICAL TECHNIQUES AND APPLICATIONS: ICMTA2021
Chemical graph theory is an emerging field in research and attracts people mainly for its applications in Chemistry. Topological indices have been extensively used in this regard. A lot of topological indices have been introduced in the recent days. A recent study has shown that it is possible to even calculate the boiling point of a molecule using topological indices. This paper aimed at calculating the most trending degree based topological index for a family of graphs.
Mathematical Problems in Engineering
In all types of topological indicators, degree-based indicators play a major role in chemical graph theory. The topological index is a fixed numeric value associated with graph isomerism. Firstly, in 1972, the concept of degree-based index was developed by Gutman and Trinajstic. These degree-based indices are divided into two ways, namely, degree and connection number. These degree-based graph indices are positive-valued for non-regular graphs and zero for regular graphs. In this article, we discussed the degree-based Sombor, reduced Sombor, and average Sombor indices for wheel graph, gear graph, helm graph, flower graph, sunflower graph, and lobster graph.
Contributions to Mathematics
This paper is concerned with a recently introduced graph invariant, namely the Sombor index. Some bounds on the Sombor index are derived, and then utilized to establish additional bounds by making use of the existing results. One of the direct consequences of one of the obtained bounds is that the cycle graph Cn attains the minimum Sombor index among all connected unicyclic graphs of a fixed order n ≥ 4. Graphs having the maximum Sombor index are also characterized from the classes of all connected unicyclic, bicyclic, tricyclic, tetracyclic, and pentacyclic graphs of a fixed order, and a conjecture concerning the maximum Sombor index of graphs of higher cyclicity is stated. A structural result is derived for graphs with integer values of Sombor index. Several possible directions for future work are also indicated.
Iranian journal of mathematical chemistry, 2021
Let $G=(V,E)$ be a finite simple graph. The Sombor index $SO(G)$ of $G$ is defined as $sum_{uvin E(G)}sqrt{d_u^2+d_v^2}$, where $d_u$ is the degree of vertex $u$ in $G$. In this paper, we study this index for certain graphs and we examine the effects on $SO(G)$ when $G$ is modified by operations on vertex and edge of $G$. Also we present bounds for the Sombor index of join and corona product of two graphs.
Symmetry
Let G be a graph with vertex set V(G) and edge set E(G). A graph invariant for G is a number related to the structure of G which is invariant under the symmetry of G. The Sombor and reduced Sombor indices of G are two new graph invariants defined as SO(G)=∑uv∈E(G)dG(u)2+dG(v)2 and SOred(G)=∑uv∈E(G)dG(u)−12+dG(v)−12, respectively, where dG(v) is the degree of the vertex v in G. We denote by Hn,ν the graph constructed from the star Sn by adding ν edge(s), 0≤ν≤n−2, between a fixed pendent vertex and ν other pendent vertices. Réti et al. [T. Réti, T Došlić and A. Ali, On the Sombor index of graphs, Contrib. Math.3 (2021) 11–18] proposed a conjecture that the graph Hn,ν has the maximum Sombor index among all connected ν-cyclic graphs of order n, where 0≤ν≤n−2. In some earlier works, the validity of this conjecture was proved for ν≤5. In this paper, we confirm that this conjecture is true, when ν=6. The Sombor index in the case that the number of pendent vertices is less than or equal to ...
AIP Conference Proceedings, 2023
The idea of Sombor index (SO) was newly presented by Gutman in the organic graph theory. Sombor index SO is symbolized by a degree of the node SO and it is defined by of different graphs are presented. Additional, clarify the theorems through examples.
arXiv (Cornell University), 2022
The Sombor index (SO) is a vertex-degree-based graph invariant, defined as the sum over all pairs of adjacent vertices of d 2 i + d 2 j , where d i is the degree of the i-th vertex. It has been conceived using geometric considerations. Recently, a series of new SO-like degree-based graph invariants (denoted by SO 1 , SO 2 , ..., SO 6) is taken into consideration, when the geometric background of several classical topological indices (Zagreb, Albertson) has considered. In this paper, we compute and study these new indices for some graphs, cactus chains and polymers.
Molecules
Let G be a simple graph with the vertex set V={v1,…,vn} and denote by dvi the degree of the vertex vi. The modified Sombor index of G is the addition of the numbers (dvi2+dvj2)−1/2 over all of the edges vivj of G. The modified Sombor matrix AMS(G) of G is the n by n matrix such that its (i,j)-entry is equal to (dvi2+dvj2)−1/2 when vi and vj are adjacent and 0 otherwise. The modified Sombor spectral radius of G is the largest number among all of the eigenvalues of AMS(G). The sum of the absolute eigenvalues of AMS(G) is known as the modified Sombor energy of G. Two graphs with the same modified Sombor energy are referred to as modified Sombor equienergetic graphs. In this article, several bounds for the modified Sombor index, the modified Sombor spectral radius, and the modified Sombor energy are found, and the corresponding extremal graphs are characterized. By using computer programs (Mathematica and AutographiX), it is found that there exists only one pair of the modified Sombor e...
2021
Topological indices are mathematical measure which correlates to the chemical structures of any simple finite graph. These are used for Quantitative Structure-Activity Relationship (QSAR) and Quantitative Structure-Property Relationship (QSPR). In this paper, we define operator graph namely, ℘ graph and structured properties. Also, establish the lower and upper bounds for few topological indices namely, Inverse sum indeg index, Geometric-Arithmetic index, Atom-bond connectivity index, first zagreb index and first reformulated Zagreb index of ℘-graph.
Journal of Mathematics
Topological indices are numeric values associated with a graph and characterize its structure. There are various topological indices in graph theory such as degree-based, distance-based, and counting-related topological indices. Among these indices, degree-based indices are very interesting and studied well in literature. In this work, we studied the generalized form of harmonic, geometric-arithmetic, Kulli–Basava indices, and generalized power-sum-connectivity index for special graph that are bridge graph over path, bridge graph over cycle, bridge graph over complete graph, wheel graph, gear graph, helm graph, and square lattice graph. We found exact values for the stated indices and for the stated special graphs. We also investigated the generalized form of the indices for various properties of alkane isomers, from which we obtained interesting results which are closed to that of experimental obtained results.
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.
Journal of Discrete Mathematical Sciences and Cryptography, 2020
Match Communications in Mathematical and in Computer Chemistry
Iranian Journal of Mathematical Chemistry, 2019
Journal of Chemistry
Proyecciones (Antofagasta), 2020
International Journal of Analysis and Applications, 2022
Journal of Advanced Research in Applied Sciences and Engineering Technology, 2024
Mathematical Problems in Engineering
Journal of Discrete Mathematical Sciences and Cryptography, 2019
Journal of Molecular Structure, 2021
Hacettepe Journal of Mathematics and Statistics, 2019
Advances in Mathematics: Scientific Journal
Iraqi journal of science, 2020