赋矩阵权图的邻接矩阵的逆矩阵（英文）.docVIP

赋矩阵权图的邻接矩阵的逆矩阵（英文） 　　摘 要 考虑边赋权图，其权是阶数相同的方阵.加权图的邻接矩阵和定向加权图的斜邻接矩阵以自然的方式定义.给出了具有唯一完美匹配的二部图的赋权图的邻接矩阵和斜邻接矩阵的逆矩阵的表达式，并说明这些公式在分块矩阵求逆中的应用. 　　关键词 加权图；邻接矩阵；斜邻接矩阵；逆矩阵 　　1 Introduction 　　We only consider graphs which have no loops or multiple edges. Let G=（V，E） be a connected graph with vertex set V={1，2，…，n} and edge set E. A weighted graph is a graph in which each edge is assigned a weight， which is usually positive number. An unweighted graph， or simply a graph， is thus a weighted graph with each of the edges bearing weight 1. 　　A weighted graph is a graph， each edge of which has been assigned a square matrix， called the weight of the edge. All the weight matrices will be assumed to be of the same order and nonnull. In this note， by “weighted graph” we will mean a “weighted graph with each of its edges bearing a nonnull matrix as weight”， unless otherwise stated. The spectra of these weighted graph were investigated by Das in [1～4] recently. We now introduce some more notation. Let G be a weighted graph on n vertices. Denote by wi，j the nonnull weight matrix of order p of the edge ij， and assume that wi，j=wj，i. We write ij∈E if vertices i and j are adjacent. 　　The adjacency matrix of a weighted graph is a block matrix， denoted and defined as A（G）=（ai，j）， where 　　ai，j=wi，j，if ij∈E， 　　0，otherwise. 　　Note that in the definition above， the zero denotes the p×p zero matrix. Thus A（G） is a square matrix of order np. Note also that the adjacency matrix A=（ai，j） of a weighted digraph satises ai，j=aj，i but is not nesessary symmetric in general. A （weighted or unweighted） graph G is said to be nonsingular if its adjacency matrix A（G） is nonsingular. 　　Let G be a （weighted） graph and G be an orientation of a （weighted） graph G， which assigns to each edge of G a direction so that G becomes a （weighted） directed graph， we call these （weighted） oriented graphs. In this paper we only consider digraphs which are oriented graphs. 　　The skewadjacency matrix of a weighted graph G （r