Sharp bounds on the symmetric division deg index of graphs and line graphs
Combinatorics
2022-07-12 v1
Abstract
For a graph with vertex set and edge set , the symmetric division deg index is defined as , where denotes the degree of vertex in . 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.
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