混合图的Laplacian特征向量  

Laplacian Eigenvector of Mixed Graph

作　　者：崔淑玉[1] 张先迪[2] 

机构地区：[1]菏泽学院数学系,山东菏泽274015 [2]电子科技大学应用数学学院,成都610054

出　　处：《电子科技大学学报》2007年第S1期363-364,381,共3页Journal of University of Electronic Science and Technology of China

摘　　要：给出了混合图的Laplacian特征向量的四个原则:边原则、减少和延伸原则、配对原则、收缩原则,研究了通过加边、合并点等对混合图的Laplacian特征值和特征向量的影响.借助于这些原则,可由一个结构上较简单的混合图的Laplacian特征值和特征向量,求出一个结构上较复杂的混合图的Laplacian特征值.In this paper,we prove four Laplacian eigenvector principles of mixed graph that is edge principle, reduction and extension principle,alternating principle,and contraction principle.These principles illustrate the effects on the Laplacian eigenvalues and eigenvectors of mixed graph by adding edges,coalescing vertexes,etc.At the same time,on the base of the Laplacian eigenvalues and eigenvectors of a simple mixed graph in the structure, we gain the Laplacian eigenvalues of a complex mixed graph in the structure.

关 键 词：特征值 特征向量 LAPLACIAN特征值 混合图 

分 类 号：O157.5[理学—数学]