Question

Question about isomorphism between two graphs

score 31 · Answer 1 · 2018-11-17 01:11:32

31

Views

Question about isomorphism between two graphs

Published on 17 Nov 2018 - 1:11

score 1.2k · Answer 2 · 2026-03-25 10:53:08

1.2k

Views

Draw bipartite graph with degree sequence (5,5,5,5,4,4,4,4,4,4,4,4,4,4)?

Published on 25 Mar 2026 - 10:53

score 35 · Answer 3 · 2018-11-17 16:09:28

35

Views

Construction of graph with degrees $d$ and $(d + 1)$

Published on 17 Nov 2018 - 16:09

score 177 · Answer 4 · 2018-11-18 12:10:48

Describe all k-tuples (n1, n2,...,nk) of natural numbers, k = 1, 2,..., such that complete bipartite graph K(n1,n2,...,nk) is a planar graph.

score 395 · Answer 5 · 2026-03-25 07:43:00

395

Views

How to verify that a problem is in co-NP or NP?

Published on 25 Mar 2026 - 7:43

score 3.2k · Answer 6 · 2018-11-18 18:31:56

3.2k

Views

In any group of 17 people, where each person knows 4 others, you can find 2 people, which don't know each other and have no common friends.

Published on 18 Nov 2018 - 18:31

score 1.9k · Answer 7 · 2018-11-18 21:10:34

If a graph has a chromatic number $k$, then for any color there is a vertex of that color that has as neighbors all the other colors

score 368 · Answer 8 · 2026-03-25 06:10:14

368

Views

Eigenvalues of an adjacency matrix

Published on 25 Mar 2026 - 6:10

score 75 · Answer 9 · 2018-11-19 01:35:52

75

Views

graph theory and linear algebra

Published on 19 Nov 2018 - 1:35

score 29 · Answer 10 · 2018-11-19 03:17:10

29

Views

How many copies of a graph $H$ containing a fixed edge in $[n]$?

Published on 19 Nov 2018 - 3:17

score 533 · Answer 11 · 2018-11-19 08:54:15

533

Views

How should I call a graph that is not a multigraph?

Published on 19 Nov 2018 - 8:54

score 264 · Answer 12 · 2018-11-19 09:57:44

264

Views

Show that this graph is $k$-connected

Published on 19 Nov 2018 - 9:57

score 3.6k · Answer 13 · 2026-03-25 10:52:09

3.6k

Views

When does the complete bipartite graph K n,m have an Euler Trail(Path)?

Published on 25 Mar 2026 - 10:52

score 93 · Answer 14 · 2018-11-19 12:01:00

93

Views

Constructing all non-isomorphic Hamiltonian graphs on n vertices

Published on 19 Nov 2018 - 12:01

score 70 · Answer 15 · 2018-11-19 12:06:22

70

Views

Coloring of two connected subgraphs

Published on 19 Nov 2018 - 12:06

List Question

Question about isomorphism between two graphs

Draw bipartite graph with degree sequence (5,5,5,5,4,4,4,4,4,4,4,4,4,4)?

Construction of graph with degrees $d$ and $(d + 1)$

Describe all k-tuples (n1, n2,...,nk) of natural numbers, k = 1, 2,..., such that complete bipartite graph K(n1,n2,...,nk) is a planar graph.

How to verify that a problem is in co-NP or NP?

In any group of 17 people, where each person knows 4 others, you can find 2 people, which don't know each other and have no common friends.

If a graph has a chromatic number $k$, then for any color there is a vertex of that color that has as neighbors all the other colors

Eigenvalues of an adjacency matrix

graph theory and linear algebra

How many copies of a graph $H$ containing a fixed edge in $[n]$?

How should I call a graph that is not a multigraph?

Show that this graph is $k$-connected

When does the complete bipartite graph K n,m have an Euler Trail(Path)?

Constructing all non-isomorphic Hamiltonian graphs on n vertices

Coloring of two connected subgraphs

Trending Questions

Popular # Hahtags

Popular Questions