摘要
研究n阶简单有向连通图的n - 1传导矩阵 ,引入子图真值向量及运算 ,得出n阶简单有向连通图关联矩阵右逆的图特征 ;提出一种寻找简单有向连通图全部生成树的方法。
The paper studies the graphical significance of n 1 order adjoint matrix of conduction matrix of an n order connected simple digraph.It introdues the real value vector and its arithmetic of the subgraph and obtains the graphical character of the right inverse of the incidence matrix of the connected simple digraph.And it proposes a method for finding all spanning tree in a connected simple digraph. [WT5HZ]
出处
《重庆大学学报(自然科学版)》
CAS
CSCD
2000年第2期34-38,55,共6页
Journal of Chongqing University