No Detail Found!

On the minimum edge-Szeged index of fully-loaded unicyclic graphs

Author(s)
Hechao Liu School of Mathematics and Statistics, Hunan Normal University, Changsha, Hunan 410081, P. R. China; School of Mathematical Sciences, South China Normal University, Guangzhou, 510631, P. R. China
Zhengping Qiu School of Mathematics and Statistics, Hunan Normal University, Changsha, Hunan 410081, P. R. China
Wenhao Hong School of Mathematics and Statistics, Hunan Normal University, Changsha, Hunan 410081, P. R. China
Zikai Tang School of Mathematics and Statistics, Hunan Normal University, Changsha, Hunan 410081, P. R. China
Abstract
The edge-Szeged index of a connected graph G is defined as the sum of products mu(ejG)mv(ejG) over all edges e = uv of G, where mu(ejG) (respectively, mv(ejG)) is the number of those edges whose distance from the vertex u (respectively, v) is smaller than the distance from the vertex v (respectively, u). A fully-loaded unicyclic graph is a unicyclic graph having no vertex of degree less than 3 on its unique cycle. In this paper, we determine the first three minimum values of the edgeSzeged index of fully-loaded unicyclic graphs having a fixed order and characterize all the graphs attaining these values.
Publication Details
Page(s) 37-41
DOI DOI not available
Published Journal: Discrete Mathematics Letters, Volume: 4, Issue: 0, Year: 2020

Request the full text from PASTIC

Keywords
fully-loaded unicyclic graph, edge-Szeged index, extremal value
References
Bondy J. A.,Murty U. S. R. .2008 .. , : .
0

Citations

0

Downloads

15

Views