The Maximum and Minimum Value of Exponential RandićIndices of Quasi-Tree Graph  

作　　者：Lei Qiu Xijie Ruan Yan Zhu Lei Qiu;Xijie Ruan;Yan Zhu(School of Mathematics, East China University of Science and Technology, Shanghai, China)

机构地区：[1]School of Mathematics, East China University of Science and Technology, Shanghai, China

出　　处：《Journal of Applied Mathematics and Physics》2024年第5期1804-1818,共15页应用数学与应用物理（英文）

摘　　要：The exponential Randić index has important applications in the fields of biology and chemistry. The exponential Randić index of a graph G is defined as the sum of the weights e 1 d( u )d( v ) of all edges uv of G, where d( u ) denotes the degree of a vertex u in G. The paper mainly provides the upper and lower bounds of the exponential Randić index in quasi-tree graphs, and characterizes the extremal graphs when the bounds are achieved.The exponential Randić index has important applications in the fields of biology and chemistry. The exponential Randić index of a graph G is defined as the sum of the weights e 1 d( u )d( v ) of all edges uv of G, where d( u ) denotes the degree of a vertex u in G. The paper mainly provides the upper and lower bounds of the exponential Randić index in quasi-tree graphs, and characterizes the extremal graphs when the bounds are achieved.

关 键 词：Exponential Randić Index Quasi-Tree Graph Extremal Value Extremal Graphs 

分 类 号：O15[理学—数学]