Questions tagged [adjacency-matrices]
An adjacency matrix is a square (0,1)-matrix used to represent a graph. Its entries indicate whether pairs of vertices are adjacent or not.
34 questions
1
vote
0
answers
119
views
Heuristics for spectral norm of directed adjacency matrix connected to prime numbers?
Are there any heuristics to compute the spectral norm of the adjacency matrix of this directed graph connected to prime numbers?
Let $p$ be a prime and $n$ be a natural number.
Define inductively for ...
1
vote
0
answers
163
views
What is the name of graphs that apply functions along their edges?
I am looking for the standard terminology for a mathematical structure consisting of a directed graph where each edge "applies a function passing through it".
Formal Definition
Let $G=(V, E)$...
2
votes
2
answers
352
views
Adjacency graphs and eigenvalues
I am currently reading this paper and this related paper (can also be found here), which explore the connection between Jordan normal forms and adjacency graphs.
Theorem 6 in the first paper reads
...
- 79
0
votes
0
answers
136
views
Constraints on building adjacency matrices
We know that all adjacency matrices are square matrices.
When our weighted directed graphs have loops or parallel edges, we obtain adjacency matrices that are, in general, asymmetric or non-Hermitian ...
- 79
2
votes
1
answer
498
views
Comparing two adjacency matrices for graph equality
I'm currently working on a project that partially involves graphs. One of the problems I'm tackling is determining whether two given matrices represent the same connected undirected graph.
So given ...
- 45
0
votes
1
answer
193
views
Product of adjacency matrices and connected graphs
Let $G$ and $ H$ be two graphs on the same vertex set (i.e. $V(G)=V(H)$).
Suppose that $K$ is the graph with adjacency matrix $A_G\times A_H$, where $A_G$ and $A_H$ are adjacency matrix of $G$ and $H$,...
- 247
2
votes
0
answers
83
views
Regularize a graph while embedding the spectrum of adjacency matrix
Given an irregular graph $G$ whose maximum degree is $d$, I am interested in producing a new graph $G'$ which is regular and has the spectrum of the adjacency spectrum of $G$ embedded in the spectrum ...
- 21
6
votes
1
answer
711
views
Non-diagonalizability of the adjacency matrix of a directed graph
Let $G$ be a directed graph with no multiple edges or loops and let $P_i$ be its vertices. Let $A$ be the corresponding adjacency matrix of $G$, i.e. $a_{i,j}=1$ if and only if there is a directed ...
- 4,150
1
vote
0
answers
404
views
Eigenvalue decomposition of normalized adjacency matrix
Let $A$ be an adjacency matrix of undirected graph $G$, where $G$ is a connected graph. The normalized adjacency matrix is defined as $\hat{A}=D^{-1/2}AD^{-1/2}$, where $D$ is degree matrix of graph $...
- 11
6
votes
0
answers
333
views
(How) does the spectral gap of the $n\times n$ Rubik's cube close with $n$?
Consider the spectrum of the adjacency matrix $A$ of the Cayley graph of the standard, 3x3x3 Rubik's cube generated with the usual quarter-turn and half-turn twists of each face (the Singmaster ...
- 2,245
0
votes
0
answers
121
views
Show that two matrices are strongly shift equivalent
The following question is from Introduction to dynamical systems, written by Michael Brin and Garrett Stuclk.
Given two non-negative integer square matrices $A, B$, we say $A, B$ are elementarily ...
- 369
3
votes
1
answer
625
views
Solution to the sum of k-step path lengths between node pairs in directed weighted graphs
In a non weighted graph, the adjacency matrix ($A$) raised to the power $k$ will return the number of k-step paths between nodes $i$ and $j$ at the entry $a_{ij}$. Is there an equivalent for weighted ...
- 33
2
votes
0
answers
236
views
Formulas to determine the value of graph energy with addition or deletion of edges
If $G$ is a graph, then the graph energy of $G$ denoted by $E(G)$ is defined as the sum of absolute values of eigenvalues of the adjacency matrix of $G$. It is known that $E(G)\geq E(G-v)$, where $ ...
- 203
5
votes
0
answers
588
views
Computing adjacency matrix eigenvalues by counting closed walks
Let $G$ be a finite undirected graph. A closed walk in $G$ is a walk from any vertex of $G$ to itself. It is relatively straightforward to show that the total number of closed walks of length $k$ in $...
- 26k
24
votes
6
answers
2k
views
Factorization of the characteristic polynomial of the adjacency matrix of a graph
Let $G$ be a regular graph of valence $d$ with finitely many vertices, let $A_G$ be its adjacency matrix, and let $$P_G(X)=\det(X-A_G)\in\mathbb{Z}[X]$$ be the adjacency polynomial of $G$, i.e., the ...
- 48.8k
11
votes
1
answer
2k
views
Eigenvalues of the complement of a graph
Let $A$ and $\widetilde A$ be the adjacency matrices of a graph $G$ and of its complement, respectively.
Is there any relation between the eigenvalues of $A + \widetilde A$ and the eigenvalues of $A$ ...
- 1,329
4
votes
1
answer
493
views
Digraphs with unique walk of length $k$ between any two vertices
Let $G$ be a digraph such that there is an unique directed walk of length $k$ between any two vertices.
Equivalently, if $A$ is the adjacency matrix of $G$, then $A^k$ is the matrix with all entries $...
- 4,097
3
votes
1
answer
255
views
Traces and closed walks that do not close before their time
Let $A$ be the adjacency matrix of a graph. Then, as is well-known and trivial to show, $\mathrm{Tr} A^k$ equals the number of closed walks of length $k$.
Is there a similar way to express (a) the ...
- 22k
1
vote
1
answer
1k
views
Do there exist graphs whose adjacency matrix is positive semi-definite? [closed]
If so, could you provide examples and specify the conditions under which this occurs? Thank you in advance
2
votes
1
answer
781
views
Leading eigenvector value problem as an optimisation problem for asymmetric matrices
As noted in 1806.05647, given a symmetric matrix $A$, the leading eigenvector value problem (LEVP)
$$Av = \lambda v,$$
where $A = A^T \in \mathbb{R}^{n \times n}$, $\lambda$ is the largest ...
- 21
1
vote
1
answer
2k
views
Significance of the Eigenvalues of the adjacency matrix of a weighted di-graph
I'm currently running a simulation on a bunch of randomly generated points, each with two randomly selected 'partners' from the set of points. In the simulation the points try to move such that they ...
- 13
2
votes
2
answers
284
views
Adjacency matrix of total graph
Is there a nice way of relating the adjacency, incidence , Laplacian matrices and other matrices associated to a graph of a total graph with its original graph, or, say, at least relating that of the ...
- 2,145
5
votes
1
answer
497
views
Determining the primitive order of a binary matrix
Let ${\bf A}_n$ be an $2n \times 2n$ matrix that is defined as follows
$$
{\bf A}_n=\left(
\begin{array}{c}
0&0&\cdots&0&0&0&0&1&1\\
0&0&\cdots&0&0&...
- 313
2
votes
1
answer
356
views
When does a row standardized adjacency matrix have a real spectrum?
A colleague in spatial statistics was looking at a map with about 600 regions. For the application she's considering, the induced adjacency matrix had some undesirable properties (where two regions ...
- 6,523
3
votes
1
answer
802
views
Finding an adjacency matrix whose cube's diagonal is equal to a given vector
How can I find all binary matrices $A$ such that $A^3$ is a non-negative, integer square matrix and
$$\mbox{diag}\left(A^3\right)=b$$
for some given vector $b$?
Is there a way to characterize all ...
- 503
10
votes
1
answer
656
views
is it possible to have two non-isomorphic non-regular graphs with the same adjacent spectrum and the same laplacian spectrum?
For two regular graphs $G$ and $H$, it is possible for them to share the same adjacent spectrum and the same laplacian spectrum. While, on the other hand, is it possible to have two non-regular graphs ...
- 103
1
vote
0
answers
124
views
Primitivity of $AA^\top$
Let $A\in\mathbb{R}^{n\times n}$ be a non-negative and irreducible matrix. Consider $B:=AA^\top$. It can be proved (I can post a proof if needed) that the following condition is necessary and ...
- 2,752
2
votes
0
answers
192
views
Which functions preserve the connectivity of graphs/components?
I am somewhat stuck working on an issue and would really love some guidance. I will state the problem, my current state and what led to it in case the solution lies beyond where I was looking
The ...
- 21
8
votes
3
answers
9k
views
Spectrum of an adjacency matrix
The adjacency matrix of a non-oriented connected graph is symmetric, hence its spectrum is real.
If the graph is bipartite, then the spectrum of its adjacency matrix is symmetric about 0. A few ...
- 3,558
12
votes
5
answers
2k
views
Which directed graphs have a normal adjacency matrix?
I am working on a problem in matrix analysis and I am looking for certain types of normal matrices. I suspect that these "special" normal matrices arise as adjacency matrices of certain graphs. My ...
- 3,779
1
vote
2
answers
224
views
Is there a name for this operation on graphs - e.g. duplication, Kronecker product of graphs?
I am revising a paper where one of the operations performed on a undirected graph with no loops, is to take each vertex, and split it into two vertices, and take each edge and replace it with 4 edges: ...
- 129
-2
votes
1
answer
360
views
adjacency matrix of random geometric graphs [closed]
Consider a graph with N nodes. All nodes are distributed as a Poisson point process with density of λ in a L*L area. There is an edge between two nodes if and only if the distance between them is less ...
- 55
1
vote
1
answer
285
views
power bounded adjacency matrices
A bounded linear operator $T$ on a Banach space $X$ is called power bounded if $\|T^k\|\le M$ for some $M>0$ and all $k\in \mathbb N$.
A classical result of Lorch says that if $X$ is reflexive, ...
- 3,558
14
votes
2
answers
7k
views
Is there an "adjacency matrix" for weighted directed graphs that captures the weights?
I am currently writing up some notes on the max-plus algebra $\mathbb{R}_{\max}$ (for those that have never seen the term "max-plus algebra", it is just $\mathbb{R}$ with addition replaced ...
- 403