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

      Nordhaus-Guddum type results for the Steiner Gutman index of graphs

      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

          Building upon the notion of Gutman index \(\operatorname{SGut}(G)\), Mao and Das recently introduced the Steiner Gutman index by incorporating Steiner distance for a connected graph \(G\). The \emph{Steiner Gutman \(k\)-index} \(\operatorname{SGut}_k(G)\) of \(G\) is defined by \(\operatorname{SGut}_k(G)\) \(=\sum_{S\subseteq V(G), \ |S|=k}\left(\prod_{v\in S}deg_G(v)\right) d_G(S)\), in which \(d_G(S)\) is the Steiner distance of \(S\) and \(deg_G(v)\) is the degree of \(v\) in \(G\). In this paper, we derive new sharp upper and lower bounds on \(\operatorname{SGut}_k\), and then investigate the Nordhaus-Gaddum-type results for the parameter \(\operatorname{SGut}_k\). We obtain sharp upper and lower bounds of \(\operatorname{SGut}_k(G)+\operatorname{SGut}_k(\overline{G})\) and \(\operatorname{SGut}_k(G)\cdot \operatorname{SGut}_k(\overline{G})\) for a connected graph \(G\) of order \(n\), \(m\) edges and maximum degree \(\Delta\), minimum degree \(\delta\).

          Related collections

          Author and article information

          Journal
          09 July 2021
          Article
          2107.05742
          4d4e386e-bfff-46c7-ae43-b61d149802bc

          http://creativecommons.org/licenses/by/4.0/

          History
          Custom metadata
          math.CO

          Combinatorics
          Combinatorics

          Comments

          Comment on this article