English

Sharp bounds on the symmetric division deg index of graphs and line graphs

Combinatorics 2022-07-12 v1

Abstract

For a graph GG with vertex set VGV_{G} and edge set EGE_{G}, the symmetric division deg index is defined as SDD(G)=uvEG(dudv+dvdu)SDD(G)=\sum\limits_{uv\in E_{G}}(\frac{d_{u}}{d_{v}}+\frac{d_{v}}{d_{u}}), where dud_{u} denotes the degree of vertex uu in GG. In 2018, Furtula et al. confirmed the quality of SDD index exceeds that of some more popular VDB indices, in particular that of the GA index. They shown a close connection between the SDD index and the earlier well-established GA index. Thus it is meaningful and important to consider the chemical and mathematical properties of the SDD index. In this paper, we determine some sharp bounds on the symmetric division deg index of graphs and line graphs and characterize the corresponding extremal graphs.

Keywords

Cite

@article{arxiv.2207.04433,
  title  = {Sharp bounds on the symmetric division deg index of graphs and line graphs},
  author = {Hechao Liu and Yufei Huang},
  journal= {arXiv preprint arXiv:2207.04433},
  year   = {2022}
}

Comments

15 pages