Search arXivSearch

arXiv · 2107.05742

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

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 $Δ$, minimum degree $δ$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zhao Wang, Yaping Mao, Kinkar Chandra Das, Yilun Shang. 2021-07-09. Nordhaus-Guddum type results for the Steiner Gutman index of graphs. https://arxiv.org/abs/2107.05742

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO