亚洲免费av电影一区二区三区,日韩爱爱视频,51精品视频一区二区三区,91视频爱爱,日韩欧美在线播放视频,中文字幕少妇AV,亚洲电影中文字幕,久久久久亚洲av成人网址,久久综合视频网站,国产在线不卡免费播放

        ?

        賦矩陣權(quán)圖的鄰接矩陣的逆矩陣(英文)

        2014-10-24 16:11:06崔登蘭
        關(guān)鍵詞:鄰接矩陣

        崔登蘭

        摘 要 考慮邊賦權(quán)圖,其權(quán)是階數(shù)相同的方陣.加權(quán)圖的鄰接矩陣和定向加權(quán)圖的斜鄰接矩陣以自然的方式定義.給出了具有唯一完美匹配的二部圖的賦權(quán)圖的鄰接矩陣和斜鄰接矩陣的逆矩陣的表達(dá)式,并說明這些公式在分塊矩陣求逆中的應(yīng)用.

        關(guān)鍵詞 加權(quán)圖;鄰接矩陣;斜鄰接矩陣;逆矩陣

        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 (related to an orientation G is a block matrix, denoted and defined as S(G)=(si,j), where

        si,j=wi,j,if ij∈E and i→j,

        -wi,j,if ij∈E and i←j,

        0,otherwise.

        Note that in the definition above, the zero denotes the p×p zero matrix. Thus S(G) is a square matrix of order np. Note that the skewadjacency matrix S(G)=(si,j) of a weighted graph satisfies sj,i=-si,j but S(G) is not necessary skew symmetric in general. A (weighted) digraph G is said to be skewnonsingular if its skewadjacency matrix S(G) is nonsingular. The spectra of skewadjacency matrix of a oriented graph and its applications were investigated in [5~9]. A graph G is said to have a perfect matching if there exists a spanning forest whose components are solely paths on two vertices. A graph in general can have more than one perfect matchings. It is wellknown that if a tree has a perfect matching, then it has a unique perfect matching and such trees are precisely the trees which nonsingular. In general, any graph which has a unique perfect matching is nonsingular[10], and its any orientation is also skew nonsingular, this follows from that det S=(pfS)2 for any skewsymmetric matrix, where pfS is the Pfaffian of the skewsymmetric matrix S[11].Let G be a graph with a perfect matching M. A path P(i,j)=[i=i1,i2,…,I2k=j] from a vertex i to vertex j in G is said to be an alternating path if the edges i1i2,i3i4,…,i2k-1i2k are edges in the perfect matching M. In other words, a path is called an alternating path if its edges are alternately in M and not in M, and the first edge and the last edge are in M.

        A combinatorial description of the inverse of the adjacency matrix of nonsingular tree has been given in[12] and in[13]. A combinatorial description of the inverse of the adjacency matrix of a bipartite graph without a cycle of length 4m is given in Cvetkovic[10]. A combinatorial description of the inverse of the adjacency matrix of a bipartite graph with a unique matching is given in[14]. In this note we supply a simple combinatorial description of the inverse of the adjacency matrix and skewadjacency matrix of a weighted bipartite graph with a unique perfect matching, which contains the formula due to [14] as a special case.

        2 The Main Results

        Let G be a bipartite graph with a unique perfect matching M and P(i,j) denotes the collection of all alternating paths between vertices i and j in G. Note that if P(i,j) is an alternating path between vertices i and j, then the number of edges in P(i,j) which are not in M is P(i,j)-12, where P(i,j) is the number of edges in the path P(i,j).

        Lemma 1[14] Let G be a bipartite graph with a unique perfect matching M and the edge ii′ in M. If a vertex v≠i′ is adjacent to i such that there exists an alternating path P(v,j)=[v=x1,x2,…,xn=j between vertices v and j, then P′=[i′,i,P(v, j)]=[i′,i,v,x2,…,x2k=j] is an alternating path from i′ to j.

        Note that the converse of Lemma 1 holds clearly. That is, if there is an alternating path P(i′,j) from i′ to j, it must have the form [i′,i,x1,x2,…,xm=j]. Thus there must exist a vertex v=x1≠i′ adjacent to i such that an alternating path from v to j exists.

        Lemma 2[15] Let G be a graph, then G is bipartite and has a unique perfect matching if and only if the adjacency matrix of G can be expressed as

        A(G)=0LLt0,

        where L is a lowertriangular, square (0,1)matrix with every diagonal entry equal is 1.

        It follows that the determinants of the adjacency and skewadjacency matrix of a weighted bipartite graph with a unique perfect matching are ±∏i,j∈M(det wi,j)2. Thus, the adjacency and skewadjacency matrix of a weighted bipartite graph with a unique perfect matching is nonsingular if and only if all weight matrices wi,j, where ij∈M, are nonsingular.

        The following result gives a combinatorial description of the inverse of the adjacency matrix of a weighted bipartite graph with a unique perfect matching.

        Theorem 1 Let G be a weighted bipartite graph with a unique perfect matching M and let A(G)=(aij) be its adjacency matrix. If all weight matrices wi,j where ij∈M, are nonsingular, then A(G) is nonsingular and its inverse is the block matrix B=(bi,j), where

        A combinatorial description of the inverse of the adjacency matrix of nonsingular tree has been given in[12] and in[13]. A combinatorial description of the inverse of the adjacency matrix of a bipartite graph without a cycle of length 4m is given in Cvetkovic[10]. A combinatorial description of the inverse of the adjacency matrix of a bipartite graph with a unique matching is given in[14]. In this note we supply a simple combinatorial description of the inverse of the adjacency matrix and skewadjacency matrix of a weighted bipartite graph with a unique perfect matching, which contains the formula due to [14] as a special case.

        2 The Main Results

        Let G be a bipartite graph with a unique perfect matching M and P(i,j) denotes the collection of all alternating paths between vertices i and j in G. Note that if P(i,j) is an alternating path between vertices i and j, then the number of edges in P(i,j) which are not in M is P(i,j)-12, where P(i,j) is the number of edges in the path P(i,j).

        Lemma 1[14] Let G be a bipartite graph with a unique perfect matching M and the edge ii′ in M. If a vertex v≠i′ is adjacent to i such that there exists an alternating path P(v,j)=[v=x1,x2,…,xn=j between vertices v and j, then P′=[i′,i,P(v, j)]=[i′,i,v,x2,…,x2k=j] is an alternating path from i′ to j.

        Note that the converse of Lemma 1 holds clearly. That is, if there is an alternating path P(i′,j) from i′ to j, it must have the form [i′,i,x1,x2,…,xm=j]. Thus there must exist a vertex v=x1≠i′ adjacent to i such that an alternating path from v to j exists.

        Lemma 2[15] Let G be a graph, then G is bipartite and has a unique perfect matching if and only if the adjacency matrix of G can be expressed as

        A(G)=0LLt0,

        where L is a lowertriangular, square (0,1)matrix with every diagonal entry equal is 1.

        It follows that the determinants of the adjacency and skewadjacency matrix of a weighted bipartite graph with a unique perfect matching are ±∏i,j∈M(det wi,j)2. Thus, the adjacency and skewadjacency matrix of a weighted bipartite graph with a unique perfect matching is nonsingular if and only if all weight matrices wi,j, where ij∈M, are nonsingular.

        The following result gives a combinatorial description of the inverse of the adjacency matrix of a weighted bipartite graph with a unique perfect matching.

        Theorem 1 Let G be a weighted bipartite graph with a unique perfect matching M and let A(G)=(aij) be its adjacency matrix. If all weight matrices wi,j where ij∈M, are nonsingular, then A(G) is nonsingular and its inverse is the block matrix B=(bi,j), where

        A combinatorial description of the inverse of the adjacency matrix of nonsingular tree has been given in[12] and in[13]. A combinatorial description of the inverse of the adjacency matrix of a bipartite graph without a cycle of length 4m is given in Cvetkovic[10]. A combinatorial description of the inverse of the adjacency matrix of a bipartite graph with a unique matching is given in[14]. In this note we supply a simple combinatorial description of the inverse of the adjacency matrix and skewadjacency matrix of a weighted bipartite graph with a unique perfect matching, which contains the formula due to [14] as a special case.

        2 The Main Results

        Let G be a bipartite graph with a unique perfect matching M and P(i,j) denotes the collection of all alternating paths between vertices i and j in G. Note that if P(i,j) is an alternating path between vertices i and j, then the number of edges in P(i,j) which are not in M is P(i,j)-12, where P(i,j) is the number of edges in the path P(i,j).

        Lemma 1[14] Let G be a bipartite graph with a unique perfect matching M and the edge ii′ in M. If a vertex v≠i′ is adjacent to i such that there exists an alternating path P(v,j)=[v=x1,x2,…,xn=j between vertices v and j, then P′=[i′,i,P(v, j)]=[i′,i,v,x2,…,x2k=j] is an alternating path from i′ to j.

        Note that the converse of Lemma 1 holds clearly. That is, if there is an alternating path P(i′,j) from i′ to j, it must have the form [i′,i,x1,x2,…,xm=j]. Thus there must exist a vertex v=x1≠i′ adjacent to i such that an alternating path from v to j exists.

        Lemma 2[15] Let G be a graph, then G is bipartite and has a unique perfect matching if and only if the adjacency matrix of G can be expressed as

        A(G)=0LLt0,

        where L is a lowertriangular, square (0,1)matrix with every diagonal entry equal is 1.

        It follows that the determinants of the adjacency and skewadjacency matrix of a weighted bipartite graph with a unique perfect matching are ±∏i,j∈M(det wi,j)2. Thus, the adjacency and skewadjacency matrix of a weighted bipartite graph with a unique perfect matching is nonsingular if and only if all weight matrices wi,j, where ij∈M, are nonsingular.

        The following result gives a combinatorial description of the inverse of the adjacency matrix of a weighted bipartite graph with a unique perfect matching.

        Theorem 1 Let G be a weighted bipartite graph with a unique perfect matching M and let A(G)=(aij) be its adjacency matrix. If all weight matrices wi,j where ij∈M, are nonsingular, then A(G) is nonsingular and its inverse is the block matrix B=(bi,j), where

        猜你喜歡
        鄰接矩陣
        一類樹的鄰接矩陣的Moore-Penrose廣義逆
        輪圖的平衡性
        幾類正慣性指數(shù)為2的圖的刻畫
        基于改進(jìn)Dijkstra算法的燃?xì)鈶?yīng)急模擬演練研究
        《最強(qiáng)大腦》中“火線對(duì)決”游戲的數(shù)字化分析
        基于ISM模型的海外石油開發(fā)服務(wù)合同價(jià)值影響因素分析
        消防車路徑優(yōu)化問題的研究
        魅力中國(2017年13期)2017-09-20 00:31:40
        基于鄰接矩陣變型的K分網(wǎng)絡(luò)社團(tuán)算法
        基于子模性質(zhì)的基因表達(dá)譜特征基因提取
        一種判定的無向圖連通性的快速Warshall算法
        精品少妇人妻av无码久久| 亚洲精品综合久久国产二区| 91久久精品美女高潮喷白浆| 欧美性生交活xxxxxdddd| 国产精品三级在线观看无码| 人妻AV无码一区二区三区奥田咲| 97人妻蜜臀中文字幕| 亚洲av色图一区二区三区| 人妻少妇无码精品视频区| 国产人碰人摸人爱视频| 69堂在线无码视频2020| 亚洲精品一区二区成人精品网站| а天堂8中文最新版在线官网| 亚洲av无码精品色午夜蛋壳| 免青青草免费观看视频在线| 美女丝袜诱惑在线播放蜜桃| 国产免费又爽又色又粗视频 | 亚洲a无码综合a国产av中文| 日本50岁丰满熟妇xxxx| 亚洲专区路线一路线二天美| 亚洲精品久久麻豆蜜桃| 婷婷色综合视频在线观看| 国产精品久久久久久无码| 亚洲午夜无码视频在线播放| 91亚洲免费在线观看视频| 男女猛烈无遮挡免费视频| 欧美喷潮久久久xxxxx| 日本最新一区二区三区免费看| 91三级在线观看免费| 97人妻精品一区二区三区 | 人妻丰满熟妇av无码区| 国产午夜视频在永久在线观看| 色婷婷久久99综合精品jk白丝| 色婷婷久久亚洲综合看片| 人妻夜夜爽天天爽一区| 午夜影视啪啪免费体验区入口| 蜜桃成熟时日本一区二区| 亚洲色中文字幕无码av| 中文字幕在线亚洲日韩6页手机版| 午夜男女视频一区二区三区| 久久亚洲道色综合久久|