학술논문

New Bounds on Sombor Index.
Document Type
Article
Source
Communications in Combinatorics & Optimization. 2023, Vol. 8 Issue 2, p305-311. 7p.
Subject
*CHARTS, diagrams, etc.
*SET theory
*TOPOLOGICAL degree
*GAME theory
*PARETO analysis
Language
ISSN
2538-2128
Abstract
The Sombor index of the graph G is a degree based topological index, defined as SO=∑uv∈E(G)d²u+d²v--√, where du is the degree of the vertex u, and E(G) is the edge set of G. Bounds on SO are established in terms of graph energy, size of minimum vertex cover, matching number, and induced matching number. [ABSTRACT FROM AUTHOR]