| 关于图能量上界的注释 |
| |
| 引用本文： | 王海明. 关于图能量上界的注释[J]. 青海师范大学学报(自然科学版), 2014, 0(2): 13-15 |
| |
| 作者姓名： | 王海明 |
| |
| 作者单位： | 青海师范大学 学报编辑部,青海 西宁,810008 |
| |
| 摘 要： | 对一个简单连通图G V(,E)来说,其能量表示为图G V(,E)的邻接矩阵特征值的绝对值之和.在文献[1]中,Kinkar Ch.Das和Seyed A.Mojallal用定点个数、边数、团数以及顶点的最小度数给出了一个图能量的新上界.在计算验证中我们发现一点瑕疵,本文给予修正,并正确给出修正的图能量的上界.
|
| 关 键 词： | 简单连通图 图能量 图能量的上界 |
Note on the Upper Bound for Graph Energy |
| |
| WANG Hai-ming. Note on the Upper Bound for Graph Energy[J]. Journal of Qinghai Normal University(Natural Science Edition), 2014, 0(2): 13-15 |
| |
| Authors: | WANG Hai-ming |
| |
| Affiliation: | WANG Hal-ruing (Editorial Department of Journal of Qinghai Normal University, Xining 810008, China) |
| |
| Abstract: | For a simple connected graph G（V,E）,the energy E（G）is defined as the absolute of all eigenvalues of its adjacency matrix.In the original literature[1],Kinkar Ch.Das and Seyed A.Mojallal present a new upper bound for E（G）in terms of the numbers of vertices and edges,also the clique number and minimum degree.We verify the bound and find a little flaw.This paper gives the revised upper bound of the E（G）. |
| |
| Keywords: | graph energy upper bound minimum degree clique number |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
