E. L/ Witzke
Abstract
Adjacency matrices have been used to analyze problems with communications in organizations. Although this same approach can be applied to computer communication networks to determine their connectivity, it does have its limitations. This analysis method and its limitations will be discussed in this paper.
Index Terms
- Some limitations of adjacency matrices in computer network analysis
Recommendations
On conjugate adjacency matrices of a graph
Let G be a simple graph of order n. Let c=a+bm and c@?=a-bm, where a and b are two nonzero integers and m is a positive integer such that m is not a perfect square. We say that A^c=[c"i"j] is the conjugate adjacency matrix of the graph G if c"i"j=c for ...
Compressed Adjacency Matrices: Untangling Gene Regulatory Networks
We present a novel technique—Compressed Adjacency Matrices—for visualizing gene regulatory networks. These directed networks have strong structural characteristics: out-degrees with a scale-free distribution, in-degrees bound by a low maximum, and few ...
Adjacency matrices of probe interval graphs
In this paper we obtain several characterizations of the adjacency matrix of a probe interval graph. In course of this study we describe an easy method of obtaining interval representation of an interval bigraph from its adjacency matrix. Finally, we ...
Comments