Article detail · 2023
New bounds on Sombor index
Communications in Combinatorics and Optimization
YÖKSİS
OpenAlex
Open access · green
SJR Q2
JCR Q2
Citations 0
Percentile 45.1%
FWCI 0.0
- Year
- 2023
- ISSN
2538-2128- Type
- article
Data source split
- YÖKSİS YÖKSİS article record
- OpenAlex OpenAlex enrichment (abstract, citations, topics)
Abstract
English (OpenAlex)
The Sombor index of the graph G is a degree based topological index, defined as SO = Sigma(uv is an element of E(G)) root d(u)(2) + d(v)(2) where d(u) 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.
Topics
- Graph theory and applications
- Graph Labeling and Dimension Problems
- Advanced Graph Theory Research
Primary topic Graph theory and applications