On the zeroth-order general Randić index, variable sum exdeg index and trees having vertices with prescribed degree

preprint2017arXivOpen access

Abstract

The zeroth-order general Randić index (usually denoted by Rα0R_α^{0}) and variable sum exdeg index (denoted by SEIaSEI_{a}) of a graph GG are defined as Rα0(G)=∑v∈V(G)(dv)αR_α^{0}(G)= \sum_{v\in V(G)} (d_{v})^α and SEIa(G)=∑v∈V(G)dvadvSEI_{a}(G)= \sum_{v\in V(G)}d_{v}a^{d_{v}} where dvd_{v} is degree of the vertex v∈V(G)v\in V(G), aa is a positive real number different from 1 and αα is a real number other than 00 and 11. A segment of a tree is a path PP, whose terminal vertices are branching or pendent, and all non-terminal vertices (if exist) of PP have degree 2. For n≥6n\ge6, let PTn,n1\mathbb{PT}_{n,n_1}, STn,k\mathbb{ST}_{n,k}, BTn,b\mathbb{BT}_{n,b} be the collections of all nn-vertex trees having n1n_1 pendent vertices, kk segments, bb branching vertices, respectively. In this paper, all the trees with extremum (maximum and minimum) zeroth-order general Randić index and variable sum exdeg index are determined from the collections PTn,n1\mathbb{PT}_{n,n_1}, STn,k\mathbb{ST}_{n,k}, BTn,b\mathbb{BT}_{n,b}. The obtained extremal trees for the collection STn,k\mathbb{ST}_{n,k} are also extremal trees for the collection of all nn-vertex trees having fixed number of vertices with degree 2 (because it is already known that the number of segments of a tree TT can be determined from the number of vertices of TT with degree 2 and vise versa).

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.