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

Abstract

For a simple graph G(V,E), the zeroth-order general Randi\' c index is defined as 0Rα(G)=Σv∈ V(G)d(v)α, where d(v) is the degree of the vertex v and α0 is a real number. The k-generalized quasi-tree is a connected graph G with a subset Vk⊂ V(G), where |Vk|=k such that G-Vk is a tree, but for any subset Vk-1⊂ V(G) with cardinality k-1, G-Vk-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 α≠ 0.

0

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…