【摘要】：圖G的能量定義為其鄰接矩陣的所有特征值的絕對(duì)值之和.拉手蜘蛛圖定義為從K_2的2個(gè)端點(diǎn)分別長(zhǎng)出若干條懸掛邊和長(zhǎng)為2的懸掛路所得到的圖.用ζ_n表示點(diǎn)數(shù)為n的所有拉手蜘蛛圖構(gòu)成的集合,通過(guò)擬序的方法,研究了拉手蜘蛛圖的能量,并確定了ζ_n中能量最小的圖.
[Abstract]:The energy of graph G is defined as the sum of the absolute values of all eigenvalues of its adjacent matrix. The hand-held spider diagram is defined as the graph obtained by growing several hanging edges and 2-long suspension roads from the two ends of K 鈮，

本文編號(hào)：2496350