# Tagged Questions

**0**

votes

**0**answers

93 views

### Adjacent matrix of undirected graph with a giant component

Assuming there is a undirected random graph $G=(V,E)$, $|V|=N$ and its adjacent matirx is $A$.
What is the sufficient and necessary conditions of A for that there is a giant component of graph $G$?
...

**1**

vote

**1**answer

366 views

### Reachability in graphs using adjacent matrix

Assuming a graph $G$ with $N$ nodes distributed in a $\mathcal{L}\times\mathcal{L}$ area randomly. There is an edge between two nodes if and only if the Euler distance between them is equal or less ...

**-3**

votes

**1**answer

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

**0**

votes

**0**answers

57 views

### problem about Matrix multiple

Assuming a series of random geometric graph G1,G2,...,Gn. For each Gi, |V|=N, and nodes are distributed as a possion point process. If the distance between a pair of nodes is less than or equal to ...

**11**

votes

**2**answers

816 views

### Determinants in Graph Theory

In graph theory, we work with adjacency matrices which define the connections between the vertices. These matrices have various properties in themselves. For example, their trace can be calculated (it ...