3
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      The Sombor index of trees and unicyclic graphs with given maximum degree

      Preprint
      , ,

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          Let \(d_G(v)\) be the degree of the vertex \(v\) in a graph \(G\). The Sombor index of \(G\) is defined as \(SO(G) =\sum_{uv\in E(G)}\sqrt{d^2_G(u)+d^2_G(v)}\), which is a new degree-based topological index introduced by Gutman. Let \(\mathscr{T}_{n,\Delta}\) and \(\mathscr{U}_{n,\Delta}\) be the set of trees and unicyclic graphs with \(n\) vertices and maximum degree \(\Delta\), respectively. In this paper, the tree and the unicyclic graph with minimum Sombor index among \(\mathscr{T}_{n,\Delta}\) and \(\mathscr{U}_{n,\Delta}\) are characterized.

          Related collections

          Author and article information

          Journal
          14 March 2021
          Article
          2103.07947
          2b423eff-31fb-4f74-98e7-fd807405ea5a

          http://arxiv.org/licenses/nonexclusive-distrib/1.0/

          History
          Custom metadata
          05C05, 05C07, 05C35
          10 pages, 2 figures. arXiv admin note: text overlap with arXiv:2103.04645
          math.CO

          Combinatorics
          Combinatorics

          Comments

          Comment on this article