首页 | 本学科首页   官方微博 | 高级检索  
     

Bounds for the Least Laplacian Eigenvalue of a Signed Graph
引用本文:Yao Ping HOU. Bounds for the Least Laplacian Eigenvalue of a Signed Graph[J]. 数学学报(英文版), 2005, 21(4): 955-960. DOI: 10.1007/s10114-004-0437-9
作者姓名:Yao Ping HOU
作者单位:Department of Mathematics, Hunan Normal University, Changsha 410081, P. R. China
基金项目:The project is supported by the NSF of China (No.19971086) and SRP (No.03B019) from the Education Committee of Hunan Province.
摘    要:


关 键 词:Laplacian算子 特征值 符号图 Laplacian矩阵
收稿时间:2002-10-21
修稿时间:2002-10-212003-06-26

Bounds for the Least Laplacian Eigenvalue of a Signed Graph
Yao Ping Hou. Bounds for the Least Laplacian Eigenvalue of a Signed Graph[J]. Acta Mathematica Sinica(English Series), 2005, 21(4): 955-960. DOI: 10.1007/s10114-004-0437-9
Authors:Yao Ping Hou
Affiliation:(1) Department of Mathematics, Hunan Normal University, Changsha 410081, P. R. China
Abstract:
A signed graph is a graph with a sign attached to each edge. This paper extends some fundamental concepts of the Laplacian matrices from graphs to signed graphs. In particular, the relationships between the least Laplacian eigenvalue and the unbalancedness of a signed graph are investigated.
Keywords:Signed graph   Laplacian matrix   The least eigenvalue   Balanced signed graph
本文献已被 维普 SpringerLink 等数据库收录!
正在获取相似文献,请稍候...
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号