The Chemical Trees with Minimum Inverse Symmetric Division Deg Index
Received:March 27, 2022  Revised:February 25, 2023
Key Words: graph   inverse symmetric division deg index   chemical tree  
Fund Project:Supported by the Shanxi Scholarship Council of China (Grant No.2022-149).
Author NameAffiliation
Xiaoli LI Department of Mathematics, North University of China, Shanxi 030051, P. R. China 
Yanling SHAO Department of Mathematics, North University of China, Shanxi 030051, P. R. China 
Hits: 251
Download times: 251
Abstract:
      Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$. The inverse symmetric division deg index of $G$ is defined as $ISDD(G)=\sum_{uv \in E(G)}\dfrac{d_ud_v}{d_u^2+d_v^2}$, where $d_u$ and $d_v$ are the degrees of $u$ and $v$, respectively. A tree $T$ is a chemical tree if $d_u\le 4$ for each vertex $u\in V(T)$. In this paper, we characterize the structure of chemical trees with minimum inverse symmetric division deg index among all chemical trees of order $n$.
Citation:
DOI:10.3770/j.issn:2095-2651.2023.04.003
View Full Text  View/Add Comment