Bounds for the Least Laplacian Eigenvalue of a Signed Graph

被引:0
作者
Yao Ping HOU Department of MathematicsHunan Normal UniversityChangsha PRChina [410081 ]
机构
关键词
Signed graph; Laplacian matrix; The least eigenvalue; Balanced signed graph;
D O I
暂无
中图分类号
O157.5 [图论];
学科分类号
070104 ;
摘要
<正> A signed graph is a graph with a sign attached to each edge.This paper extends somefundamental concepts of the Laplacian matrices from graphs to signed graphs.In particular,therelationships between the least Laplacian eigenvalue and the unbalancedness of a signed graph areinvestigated.
引用
收藏
页码:955 / 960
页数:6
相关论文
共 4 条
[1]   On the Laplacian eigenvalues of signed graphs [J].
Hou, YP ;
Li, JS ;
Pan, YL .
LINEAR & MULTILINEAR ALGEBRA, 2003, 51 (01) :21-30
[2]  
On the notion of balance of a signed graph[J] . Frank Harary.The Michigan Mathematical Journal . 1953 (2)
[3]  
Spectral Graph Theory,CBMS Lecture Notes .2 Chung,F.R. . 1997
[4]  
A combinatorial proof of the all minors matrix tree theorem .2 Chaiken,S. SIAM J.Algebraic Discrete Methods . 1982