Question

On the walk-generating function

score 72 · Answer 1 · 2024-02-14 16:57:39

72

Views

On the walk-generating function

Published on 14 Feb 2024 - 16:57

score 26 · Answer 2 · 2026-03-26 10:58:12

26

Views

Reconstructing a graph from a subgraph and spectral properties

Published on 26 Mar 2026 - 10:58

score 20 · Answer 3 · 2026-02-23 15:20:12

20

Views

Check the linear independency of a set of cycles in a graph?

Published on 23 Feb 2026 - 15:20

score 16 · Answer 4 · 2026-03-26 11:05:43

16

Views

Do graph laplacian eigenvectors/values beyond the second smallest eigenvalue mean anything?

Published on 26 Mar 2026 - 11:05

score 24 · Answer 5 · 2026-03-28 13:28:07

24

Views

Using Outer Products and Matrix Multiplication to Compute Tour Weight in Traveling Salesman Problems

Published on 28 Mar 2026 - 13:28

score 34 · Answer 6 · 2024-03-20 22:46:58

34

Views

Operations of walk regular graphs

Published on 20 Mar 2024 - 22:46

score 25 · Answer 7 · 2024-03-29 10:52:38

25

Views

Strongly regular graphs that are disconnected (solved)

Published on 29 Mar 2024 - 10:52

score 750 · Answer 8 · 2026-03-25 14:22:08

750

Views

Asking for some reference for square of a graph Laplacian matrix. ($L^2$ or $L^{\dagger^2}$)

Published on 25 Mar 2026 - 14:22

score 323 · Answer 9 · 2015-01-07 15:33:16

323

Views

Finding an eigenvalue of a special cubic graph

Published on 07 Jan 2015 - 15:33

score 57 · Answer 10 · 2015-01-09 13:05:14

57

Views

graph is distance-regular if and only if the number of $i,j$ walks of length $k$ depends only on $d(i, j)$.

Published on 09 Jan 2015 - 13:05

score 59 · Answer 11 · 2015-01-09 15:18:31

59

Views

there is no distance- regular graph with intersection array $\left \{ 3, 2, 1; 1,1, 3 \right \}$.

Published on 09 Jan 2015 - 15:18

score 29 · Answer 12 · 2015-01-10 05:25:56

29

Views

showing that $h$ and $G_v$ generate $Aut(G)$.

Published on 10 Jan 2015 - 5:25

score 13.3k · Answer 13 · 2026-03-26 11:04:26

13.3k

Views

Can I find the connected components of a graph using matrix operations on the graph's adjacency matrix?

Published on 26 Mar 2026 - 11:04

score 204 · Answer 14 · 2026-03-26 14:22:49

204

Views

How to use spectral graph theory to get a measure for graph symmetry?

Published on 26 Mar 2026 - 14:22

score 672 · Answer 15 · 2026-03-25 17:32:42

672

Views

Proving or demonstrating that an adjacency matrix of a directed graph represents a cycle(s)

Published on 25 Mar 2026 - 17:32

List Question

On the walk-generating function

Reconstructing a graph from a subgraph and spectral properties

Check the linear independency of a set of cycles in a graph?

Do graph laplacian eigenvectors/values beyond the second smallest eigenvalue mean anything?

Using Outer Products and Matrix Multiplication to Compute Tour Weight in Traveling Salesman Problems

Operations of walk regular graphs

Strongly regular graphs that are disconnected (solved)

Asking for some reference for square of a graph Laplacian matrix. ($L^2$ or $L^{\dagger^2}$)

Finding an eigenvalue of a special cubic graph

graph is distance-regular if and only if the number of $i,j$ walks of length $k$ depends only on $d(i, j)$.

there is no distance- regular graph with intersection array $\left \{ 3, 2, 1; 1,1, 3 \right \}$.

showing that $h$ and $G_v$ generate $Aut(G)$.

Can I find the connected components of a graph using matrix operations on the graph's adjacency matrix?

How to use spectral graph theory to get a measure for graph symmetry?

Proving or demonstrating that an adjacency matrix of a directed graph represents a cycle(s)

Trending Questions

Popular # Hahtags

Popular Questions