The adjacency-matrices tag has no wiki summary.

**0**

votes

**2**answers

111 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: ...

**-3**

votes

**1**answer

192 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 ...

**1**

vote

**1**answer

171 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, ...