Maximum zeroth-order general Randić index of orientations of trees, unicyclic and bicyclic graphs with given matching number

2021/12/10 by Jiaxiang Yang, Yang, Jiaxiang, Hanyuan Deng +1
Chemistry · Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #Free Radicals and Antioxidants #Graph theory and applications #Optimization and Control (math.OC) #Synthesis and Properties of Aromatic Compounds

paper · pdf · doi:10.48550/arxiv.2112.05378

openalex publication_date 2021/12/10 · openalex created_date 2022/11/26 · openalex updated_date 2026/07/28

Abstract

The zeroth-order general Randić index R⁰_a of a digraph D is the sum of (d⁺_v)^a+(d^-_w)^a over all arcs vw of D, where a, d⁺_v and d^-_w are an arbitrary real number, the out-degree of the vertex v and the in-degree of the vertex w, respectively. We determine maximum zeroth-order general Randić index of oriented trees, unicyclic and bicyclic graphs in terms of matching number and order in this paper.

Related

• Maximum zeroth-order general Randić index of orientations of cacti
• Sharp bounds on the zeroth-order general Randić index of trees in terms of domination number
• Maximum first Zagreb index of orientations of unicyclic graphs with given matching number
• First and Second Maximum of Randić Index Among all k-Cyclic Graphs of a Given Order
• Some Bounds on Zeroth-Order General Randić Index