Question

Revolving door graph

score 64 · Answer 1 · 2019-01-17 10:04:02

64

Views

Revolving door graph

Published on 17 Jan 2019 - 10:04

score 74 · Answer 2 · 2019-01-17 13:20:00

74

Views

How to know that given a simple graph $G$ that a vertex $v$ if connected, then $G - v$ is also connected.

Published on 17 Jan 2019 - 13:20

score 396 · Answer 3 · 2019-01-17 14:27:55

396

Views

Tournament with the property $S_k$

Published on 17 Jan 2019 - 14:27

score 220 · Answer 4 · 2026-03-26 07:39:08

220

Views

Could a graph of order $n >2$ with two vertices of degree $n-1$ be a tree?

Published on 26 Mar 2026 - 7:39

score 134 · Answer 5 · 2019-01-17 17:34:01

134

Views

How to find number of simple non-isomorphic graphs for a given sequence?

Published on 17 Jan 2019 - 17:34

score 727 · Answer 6 · 2019-01-17 18:00:06

727

Views

hamilton-connected graph characteristics

Published on 17 Jan 2019 - 18:00

score 28 · Answer 7 · 2026-03-25 03:21:25

28

Views

It is possible for the nodes of a network to have a different total cost. If they have the same value in degree centrality?

Published on 25 Mar 2026 - 3:21

score 101 · Answer 8 · 2026-03-25 04:39:24

101

Views

Proving that the Wardrop/Nash equilibirum flow on a graph is "stable"?

Published on 25 Mar 2026 - 4:39

score 61 · Answer 9 · 2026-02-23 02:52:16

61

Views

centroid algorithm robust to missing poins

Published on 23 Feb 2026 - 2:52

score 64 · Answer 10 · 2026-03-26 07:31:00

64

Views

Example of a Tree with

Published on 26 Mar 2026 - 7:31

score 454 · Answer 11 · 2019-01-18 11:05:31

454

Views

Given a relation count the vertices and edges of a 4-regular graph

Published on 18 Jan 2019 - 11:05

score 111 · Answer 12 · 2019-01-18 14:48:35

111

Views

Antimatching in revolving door graph

Published on 18 Jan 2019 - 14:48

score 26 · Answer 13 · 2026-03-25 09:28:21

26

Views

How to set number of pairings in relation to cost

Published on 25 Mar 2026 - 9:28

score 480 · Answer 14 · 2026-03-26 07:35:23

480

Views

The number $F(n,k)$ of forests on the vertex set $[n]$ having $k$ components and such that $1, . . . , k$ belong to distinct components?

Published on 26 Mar 2026 - 7:35

score 279 · Answer 15 · 2019-01-18 16:35:22

279

Views

Proving that the complement graph is not euler graph.

Published on 18 Jan 2019 - 16:35

List Question

Revolving door graph

How to know that given a simple graph $G$ that a vertex $v$ if connected, then $G - v$ is also connected.

Tournament with the property $S_k$

Could a graph of order $n >2$ with two vertices of degree $n-1$ be a tree?

How to find number of simple non-isomorphic graphs for a given sequence?

hamilton-connected graph characteristics

It is possible for the nodes of a network to have a different total cost. If they have the same value in degree centrality?

Proving that the Wardrop/Nash equilibirum flow on a graph is "stable"?

centroid algorithm robust to missing poins

Example of a Tree with

Given a relation count the vertices and edges of a 4-regular graph

Antimatching in revolving door graph

How to set number of pairings in relation to cost

The number $F(n,k)$ of forests on the vertex set $[n]$ having $k$ components and such that $1, . . . , k$ belong to distinct components?

Proving that the complement graph is not euler graph.

Trending Questions

Popular # Hahtags

Popular Questions