Polygonal chains with minimal energy

被引：31
|
作者：
Rada, J [1 ]
Tineo, A [1 ]
机构：
[1] Univ Los Andes, Fac Ciencias, Dept Matemat, Merida 5101, Venezuela
来源：
LINEAR ALGEBRA AND ITS APPLICATIONS | 2003年 / 372卷
关键词：
energy of a graph; polygonal chains; quasi-order relation;
D O I：
10.1016/S0024-3795(03)00540-8
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
The energy of a graph G is defined as E(G)= Sigma(i=1)(P) \lambda(i)\ where lambda(i) (i = 1,...,p) are the eigenvalues of the adjacency matrix of G. We show that among all polygonal chains with polygons of 4n - 2 vertices (n greater than or equal to 2), the linear polygonal chain has minimal energy. (C) 2003 Elsevier Inc. All rights reserved.
引用
收藏
页码：333 / 344
页数：12
相关论文
共 50 条
  • [31] On the number of perfect matchings in random polygonal chains
    Wei, Shouliu
    Feng, Yongde
    Ke, Xiaoling
    Huang, Jianwu
    OPEN MATHEMATICS, 2023, 21 (01):
  • [32] Ordering polygonal chains with respect to Hosoya index
    QIAO You-fu ZHAN Fu-qin Department of Mathematics
    Applied Mathematics:A Journal of Chinese Universities, 2012, (03) : 305 - 319
  • [33] Enumeration of Wiener indices in random polygonal chains
    Wei, Shouliu
    Shiu, Wai Chee
    JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 2019, 469 (02) : 537 - 548
  • [34] Geometric restrictions on producible polygonal protein chains
    Demaine, ED
    Langerman, S
    O'Rourke, J
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2003, 2906 : 395 - 404
  • [35] Fully-angular polyhex chains with minimal total π-electron energy
    Ren, Haizhen
    Zhang, Fuji
    JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 2007, 326 (02) : 1244 - 1253
  • [36] ON THE CLASSIFICATION OF UNSTABLE MINIMAL SURFACES WITH POLYGONAL BOUNDARIES
    MARX, I
    COMMUNICATIONS ON PURE AND APPLIED MATHEMATICS, 1955, 8 (02) : 235 - 244
  • [37] Steiner Minimal Trees with One Polygonal Obstacle
    J. F. Weng
    J. MacGregor Smith
    Algorithmica, 2001, 29 : 638 - 648
  • [38] Steiner minimal trees with one polygonal obstacle
    Weng, JF
    Smith, JM
    ALGORITHMICA, 2001, 29 (04) : 638 - 648
  • [39] Separability by two lines and by nearly straight polygonal chains
    Hurtado, F
    Mora, M
    Ramos, PA
    Seara, C
    DISCRETE APPLIED MATHEMATICS, 2004, 144 (1-2) : 110 - 122
  • [40] Computing obnoxious 1-corner polygonal chains
    Díaz-Báñez, JM
    Hurtado, F
    COMPUTERS & OPERATIONS RESEARCH, 2006, 33 (04) : 1117 - 1128
12345