English

Zeroth-order general Randi\`c index of $k$-generalized quasi trees

Combinatorics 2018-01-12 v1

Abstract

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

Keywords

Cite

@article{arxiv.1801.03885,
  title  = {Zeroth-order general Randi\`c index of $k$-generalized quasi trees},
  author = {M. K. Jamil and I. Tomescu},
  journal= {arXiv preprint arXiv:1801.03885},
  year   = {2018}
}