Question

Two graphs G and F are isomorphic iff there is a bijection between E(G) an E(F)

score 233 · Answer 1 · 2026-04-17 10:39:35

233

Views

Two graphs G and F are isomorphic iff there is a bijection between E(G) an E(F)

Published on 17 Apr 2026 - 10:39

score 309 · Answer 2 · 2026-04-09 11:16:47

309

Views

Smith Normal Form and Inverse

Published on 09 Apr 2026 - 11:16

score 2k · Answer 3 · 2026-04-15 13:30:22

2k

Views

Soft question: meaning of 'disjoint' (i.e. is it edge or vertex disjoint?) in definition of a fan.

Published on 15 Apr 2026 - 13:30

score 911 · Answer 4 · 2026-04-12 08:50:56

911

Views

Why is Euler's formula for connected planar graphs different on Toruses?

Published on 12 Apr 2026 - 8:50

score 55 · Answer 5 · 2026-04-15 07:53:30

55

Views

cycle structure of bounded genus graphs

Published on 15 Apr 2026 - 7:53

score 160 · Answer 6 · 2026-04-12 13:54:57

160

Views

How many leaves will this tree have?

Published on 12 Apr 2026 - 13:54

score 737 · Answer 7 · 2026-04-14 05:36:57

737

Views

Ramsey number $R(3,7)=23$

Published on 14 Apr 2026 - 5:36

score 195 · Answer 8 · 2026-04-12 14:45:50

195

Views

maximum number of leafs in a tree with degrees at most 3.

Published on 12 Apr 2026 - 14:45

score 35 · Answer 9 · 2026-04-16 05:26:02

35

Views

A question about simple connected graph such that all degrees are at least $2$

Published on 16 Apr 2026 - 5:26

score 147 · Answer 10 · 2026-04-13 01:54:33

147

Views

How to solve a "foraging" problem on a directed graph?

Published on 13 Apr 2026 - 1:54

score 56 · Answer 11 · 2026-04-15 12:53:25

56

Views

Max cut of a sparse graph with maximum degree of 2.

Published on 15 Apr 2026 - 12:53

score 192 · Answer 12 · 2026-04-14 20:39:24

192

Views

Vertex coloring a graph with a unique vertex of maximum degree

Published on 14 Apr 2026 - 20:39

score 302 · Answer 13 · 2026-04-13 14:37:45

302

Views

Existance of a vertex which is not cut-vertex in a simple connected graph

Published on 13 Apr 2026 - 14:37

score 89 · Answer 14 · 2026-04-13 10:13:56

89

Views

On simplifying an inequality

Published on 13 Apr 2026 - 10:13

score 30 · Answer 15 · 2026-04-16 10:46:37

30

Views

Associating nodes from a set of graphs

Published on 16 Apr 2026 - 10:46

List Question

Two graphs G and F are isomorphic iff there is a bijection between E(G) an E(F)

Smith Normal Form and Inverse

Soft question: meaning of 'disjoint' (i.e. is it edge or vertex disjoint?) in definition of a fan.

Why is Euler's formula for connected planar graphs different on Toruses?

cycle structure of bounded genus graphs

How many leaves will this tree have?

Ramsey number $R(3,7)=23$

maximum number of leafs in a tree with degrees at most 3.

A question about simple connected graph such that all degrees are at least $2$

How to solve a "foraging" problem on a directed graph?

Max cut of a sparse graph with maximum degree of 2.

Vertex coloring a graph with a unique vertex of maximum degree

Existance of a vertex which is not cut-vertex in a simple connected graph

On simplifying an inequality

Associating nodes from a set of graphs

Trending Questions

Popular # Hahtags

Popular Questions