Nordhaus-Guddum type results for the Steiner Gutman index of graphs
Abstract
Building upon the notion of Gutman index SGut(G), Mao and Das recently introduced the Steiner Gutman index by incorporating Steiner distance for a connected graph G. The Steiner Gutman k-index SGutk(G) of G is defined by SGutk(G) =ΣS⊂eq V(G), \ |S|=k(Πv∈ SdegG(v)) dG(S), in which dG(S) is the Steiner distance of S and degG(v) is the degree of v in G. In this paper, we derive new sharp upper and lower bounds on SGutk, and then investigate the Nordhaus-Gaddum-type results for the parameter SGutk. We obtain sharp upper and lower bounds of SGutk(G)+SGutk(G) and SGutk(G)· SGutk(G) for a connected graph G of order n, m edges and maximum degree , minimum degree δ.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.