Question

Can a directed graph be a vector space?

score 546 · Answer 1 · 2026-03-26 22:19:10

Can a directed graph be a vector space?

Published on 26 Mar 2026 - 22:19

score 4.8k · Answer 2 · 2018-03-05 00:02:43

Draw a graph with 8 vertices, all of odd degree, that doesn't contain a path of length 3, or explain why such a graph doesn't exist.

score 53 · Answer 3 · 2018-03-05 05:05:24

53

Views

Bi-conditionals

Published on 05 Mar 2018 - 5:05

score 442 · Answer 4 · 2026-03-22 16:19:40

442

Views

What do you call the length of any longest path in a graph $G$? Is there standard notation for it?

Published on 22 Mar 2026 - 16:19

score 74 · Answer 5 · 2026-03-25 21:48:48

74

Views

Vertices of the 57 cell Perkel graph

Published on 25 Mar 2026 - 21:48

score 1.3k · Answer 6 · 2026-03-25 11:32:29

1.3k

Views

Definition of graph, using half-edges.

Published on 25 Mar 2026 - 11:32

score 1.1k · Answer 7 · 2026-03-25 15:42:18

1.1k

Views

How do I calculate the automorphism of a tree with 7 vertices?

Published on 25 Mar 2026 - 15:42

score 1.5k · Answer 8 · 2018-03-06 15:59:20

1.5k

Views

Proof verification: An edge is a bridge if and only if it does not lie on a cycle.

Published on 06 Mar 2018 - 15:59

score 207 · Answer 9 · 2026-03-23 00:05:18

207

Views

Euclidean Case of the TSP for a given problem.

Published on 23 Mar 2026 - 0:05

score 681 · Answer 10 · 2026-02-24 03:31:50

681

Views

Graphs where every vertex is connected to a vertex of each other color/label

Published on 24 Feb 2026 - 3:31

score 19 · Answer 11 · 2018-03-07 07:20:28

19

Views

Notation for set of links in a graph

Published on 07 Mar 2018 - 7:20

score 98 · Answer 12 · 2026-03-20 11:12:33

98

Views

Proving an inequality when a graph is not connected

Published on 20 Mar 2026 - 11:12

score 154 · Answer 13 · 2026-03-22 17:20:13

154

Views

What the meaning of "vertices induce hyperedges" in hypergraphs?

Published on 22 Mar 2026 - 17:20

score 610 · Answer 14 · 2026-03-25 02:57:06

610

Views

Proof with induction on $n$ so that the complete graph $K_n$ has $(n-1)!$ hamilton cycle for all $n \geq 3$.

Published on 25 Mar 2026 - 2:57

score 75 · Answer 15 · 2026-03-22 22:28:55

75

Views

Is L(H) = L(G) :: Is line graph of a hypergraph is also a line graph of a graph ??

Published on 22 Mar 2026 - 22:28

List Question

Can a directed graph be a vector space?

Draw a graph with 8 vertices, all of odd degree, that doesn't contain a path of length 3, or explain why such a graph doesn't exist.

Bi-conditionals

What do you call the length of any longest path in a graph $G$? Is there standard notation for it?

Vertices of the 57 cell Perkel graph

Definition of graph, using half-edges.

How do I calculate the automorphism of a tree with 7 vertices?

Proof verification: An edge is a bridge if and only if it does not lie on a cycle.

Euclidean Case of the TSP for a given problem.

Graphs where every vertex is connected to a vertex of each other color/label

Notation for set of links in a graph

Proving an inequality when a graph is not connected

What the meaning of "vertices induce hyperedges" in hypergraphs?

Proof with induction on $n$ so that the complete graph $K_n$ has $(n-1)!$ hamilton cycle for all $n \geq 3$.

Is L(H) = L(G) :: Is line graph of a hypergraph is also a line graph of a graph ??

Trending Questions

Popular # Hahtags

Popular Questions