Results 161 to 170 of about 1,607 (200)
Some of the next articles are maybe not open access.
Sombor Index and Elliptic Sombor Index of Benzenoid Systems
Match Communications in Mathematical and in Computer ChemistrySummary: Let \(G\) be a graph with vertex set \(V\) and edge set \(E\). A topological index has the form \[ TI=TI(G)=\sum\limits_{uv\in E}f(d_G (u),d_G (v)), \] where \(f=f(x,y)\) is a pertinently chosen function which must be symmetric and real-valued for all \(x,y\) pertaining to vertex degrees of the graph \(G\).
Chen, Xiaohong +2 more
openaire +4 more sources
Sombor index of chemical graphs
Applied Mathematics and Computation, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cruz, Roberto, Gutman, Ivan, Rada, Juan
openaire +2 more sources
Sombor Index of c-Cyclic Chemical Graphs
Match Communications in Mathematical and in Computer Chemistry, 2023Summary: The Sombor index, introduced by \textit{I. Gutman} in [MATCH Commun. Math. Comput. Chem. 86, No. 1, 11--16 (2021; Zbl 1474.92154)], has received intensive attention. The Sombor index of a graph \(G\) is defined as \(SO(G)=\sum\limits_{uv\in E(G)}\sqrt{d_u^2+d_v^2} \), where \(E(G)\) denotes the edge set in \(G\) and \(d_u\) denotes the degree ...
Liu, Hechao, You, Lihua, Huang, Yufei
openaire +1 more source
On Sombor Index for Uniform Hypergraphs
Match Communications in Mathematical and in Computer ChemistrySummary: The Sombor index for graphs is given by \textit{I. Gutman} [MATCH Commun. Math. Comput. Chem. 86, No. 1, 11--16 (2021; Zbl 1474.92154)]. Since hypergraphs can more accurately describe certain chemical scenarios. Then it has been proposed to generalize the Sombor index from graphs to hypergraphs. Recently, \textit{S. S. Shetty} and \textit{K. A.
Li, Zhuanzhuan +4 more
openaire +1 more source
On Elliptic Sombor Index with Applications
Bulletin of the Malaysian Mathematical Sciences SocietyzbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sultan Ahmad +2 more
openaire +1 more source
Relations between Energy and Sombor Index
Match Communications in Mathematical and in Computer ChemistrySummary: Let \(G\) be an arbitrary simple graph. The energy of \(G\) is defined as the sum of absolute values of all eigenvalues of its adjacency matrix and denoted by \(\mathcal{E}(G)\). Also, the Sombor index of \(G\) is defined as \(SO(G) = \sum\nolimits_{xy\in E(G)} {\sqrt{d_x^2 +d_y^2}}\), where \(d_x\) and \(d_y\) are the degree of vertices \(x\)
Akbari, Saieed +2 more
openaire +2 more sources
The Euler-Sombor Index of Trees
Match Communications in Mathematical and in Computer ChemistrySummary: In 2024, the Euler-Sombor index (EU) was introduced based on the calculation of the circumference of an ellipse, which is defined as \[ EU(G) = \sum_{uv \in E(G)} \sqrt{d(u)^2 + d(v)^2 + d(u)d(v)}. \] In this paper, we present the maximum values of the Euler-Sombor index of trees with some given parameters, such as the matching number, the ...
Ren, Xiangyu +3 more
openaire +1 more source
Sombor Index on Trees - A Review
Match Communications in Mathematical and in Computer ChemistryThe recently developed Sombor Index has garnered significant attention in the research community. Numerous studies have been published based on the Sombor index, about various versions of the Sombor index, studies on different properties of graphs, operations on graphs, chemical applications, and applications to trees.
openaire +2 more sources
Reduced Sombor index of graphs
Journal of Discrete Mathematical Sciences and CryptographyGutman developed the concept of Sombor indices and it was shown that any vertex degree-based graph invariant can be viewed as a reduced Sombor-type index. In the paper, we investigate extremal graphs concerning the reduced Sombor index for trees, unicyclic graphs, and the class of graphs with a given number of vertices and cut edges (pendent vertices).
Shiikhar Dorjsembe +2 more
openaire +1 more source