Minimum Szeged index among unicyclic graphs with perfect matchings

2019 ◽  
Vol 38 (2) ◽  
pp. 443-455 ◽  
Author(s):  
Hechao Liu ◽  
Hanyuan Deng ◽  
Zikai Tang
2020 ◽  
Vol 284 ◽  
pp. 207-223
Author(s):  
Shengjie He ◽  
Rong-Xia Hao ◽  
Yan-Quan Feng

2017 ◽  
Vol 233 ◽  
pp. 118-130 ◽  
Author(s):  
Yan Liu ◽  
Aimei Yu ◽  
Mei Lu ◽  
Rong-Xia Hao

2018 ◽  
Vol 336 ◽  
pp. 94-106 ◽  
Author(s):  
Guangfu Wang ◽  
Shuchao Li ◽  
Dongchao Qi ◽  
Huihui Zhang

2018 ◽  
Vol 43 (1) ◽  
pp. 651-672
Author(s):  
Aimei Yu ◽  
Kun Peng ◽  
Rong-Xia Hao ◽  
Jiahao Fu ◽  
Yingsheng Wang

2018 ◽  
Vol 335 ◽  
pp. 75-81 ◽  
Author(s):  
Xiaoling Sun ◽  
Yubin Gao ◽  
Jianwei Du ◽  
Lan Xu

2020 ◽  
Vol 2020 ◽  
pp. 1-7
Author(s):  
Xiaoling Sun ◽  
Jianwei Du

In this work, by using the properties of the variable sum exdeg indices and analyzing the structure of the quasi-tree graphs and unicyclic graphs, the minimum and maximum variable sum exdeg indices of quasi-tree graphs and quasi-tree graphs with perfect matchings were presented; the minimum and maximum variable sum exdeg indices of unicyclic graphs with given pendant vertices and cycle length were determined.


Sign in / Sign up

Export Citation Format

Share Document