On Ordering Chemical Trees by Energy

被引:0
作者
Ou, Jianping [1 ]
机构
[1] Wuyi Univ, Dept Math & Phys, Jiangmen 529020, Peoples R China
基金
中国国家自然科学基金;
关键词
MOLECULAR GRAPHS; ACYCLIC SYSTEMS; MINIMAL ENERGY; INDEX;
D O I
暂无
中图分类号
O6 [化学];
学科分类号
0703 ;
摘要
Three graph-transformations are introduced for maximizing the total number of matchings of a graph, by which chemical trees that have maximal energy and any prescribed maximum vertex-degree are characterized. Orderings of n-vertex chemical trees are presented according to their energy, some of which contain approximate n trees. Finally, acyclic graphs with maximal energy but without perfect matchings are also characterized.
引用
收藏
页码:157 / 168
页数:12
相关论文
共 50 条
[21]   The maximal geometric-arithmetic energy of trees with at most two branched vertices [J].
Shao, Yanling ;
Gao, Yubin .
APPLIED MATHEMATICS AND COMPUTATION, 2019, 362
[22]   Coupled bisection for root ordering [J].
Pallone, Stephen N. ;
Frazier, Peter I. ;
Henderson, Shane G. .
OPERATIONS RESEARCH LETTERS, 2016, 44 (02) :165-169
[23]   On a Poset of Trees II [J].
Csikvari, Peter .
JOURNAL OF GRAPH THEORY, 2013, 74 (01) :81-103
[24]   On the general signature trees [J].
Chen, YJ .
DATABASE AND EXPERT SYSTEMS APPLICATIONS, PROCEEDINGS, 2005, 3588 :207-219
[25]   ON THE EDGE DEGREES OF TREES [J].
Vukicevic, Damir .
GLASNIK MATEMATICKI, 2009, 44 (02) :259-266
[26]   LAPLACIAN COEFFICIENTS OF TREES [J].
Ghalavand, Ali ;
Ashrafi, Ali Reza .
RAD HRVATSKE AKADEMIJE ZNANOSTI I UMJETNOSTI-MATEMATICKE ZNANOSTI, 2020, 24 (542) :1-14
[27]   Ordering graphs by their largest (least) Aα-eigenvalues [J].
Guo, Shu-Guang ;
Zhang, Rong .
LINEAR & MULTILINEAR ALGEBRA, 2022, 70 (21) :7049-7056
[28]   Integral trees with diameter four [J].
Wang, Ligong ;
Wang, Qi ;
Huo, Bofeng .
APPLIED MATHEMATICS AND COMPUTATION, 2016, 282 :53-64
[29]   Fully Compressed Suffix Trees [J].
Russo, Luis M. S. ;
Navarro, Gonzalo ;
Oliveira, Arlindo L. .
ACM TRANSACTIONS ON ALGORITHMS, 2011, 7 (04)
[30]   Signature files and signature trees [J].
Chen, YJ .
INFORMATION PROCESSING LETTERS, 2002, 82 (04) :213-221