Papers
Topics
Authors
Recent
Search
2000 character limit reached

Zeroth-order general Randic index of $k$-generalized quasi trees

Published 11 Jan 2018 in math.CO | (1801.03885v1)

Abstract: For a simple graph $G(V,E)$, the zeroth-order general Randi\' c index is defined as $0R_{\alpha}(G)=\sum_{v\in V(G)}d(v){\alpha}$, where $d(v)$ is the degree of the vertex $v$ and $\alpha\ne0$ is a real number. The $k$-generalized quasi-tree is a connected graph $G$ with a subset $V_k\subset V(G)$, where $|V_k|=k$ such that $G-V_k$ is a tree, but for any subset $V_{k-1}\subset V(G)$ with cardinality $k-1$, $G-V_{k-1}$ is not a tree. In this paper, we characterize the extremal $k$-generalized quasi trees with the minimum and maximum values of the zeroth-order general Randi\' c index for $\alpha\neq 0$.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.