Question

Covering one part of a bipartite set

score 98 · Answer 1 · 2026-04-16 11:20:34

98

Views

Covering one part of a bipartite set

Published on 16 Apr 2026 - 11:20

score 212 · Answer 2 · 2026-04-15 18:05:59

212

Views

Channel Capacity of a Cycle Graph

Published on 15 Apr 2026 - 18:05

score 377 · Answer 3 · 2026-04-15 15:19:04

Let $H$ be the graph formed by adding a new vertex $w$ of degree $k$ and adjacent to each of $v_1,v_2,...v_k$. Show that $\kappa (H)=k$

score 241 · Answer 4 · 2026-04-09 07:40:25

241

Views

Is this dot puzzle solvable?

Published on 09 Apr 2026 - 7:40

score 153 · Answer 5 · 2026-04-16 08:29:10

153

Views

Find correspondences of nodes between two graphs

Published on 16 Apr 2026 - 8:29

score 50 · Answer 6 · 2026-04-16 08:51:18

50

Views

Least squares problem equivalent to solving Poisson problem for graph embedding given edge lengths

Published on 16 Apr 2026 - 8:51

score 54 · Answer 7 · 2026-04-12 01:05:02

54

Views

Isomorphism between graphs with coloured edges

Published on 12 Apr 2026 - 1:05

score 486 · Answer 8 · 2026-04-16 05:11:51

Show that there exists a sequence $T=T_0,T_1,...,T_k=T'$ of spanning trees of $G$ such that $T_i$ and $T_{i+1}$ have $n-2$ edges in common

score 2.1k · Answer 9 · 2026-04-16 20:50:56

2.1k

Views

Prove that if $G$ is a $k$-connected graph, then $G \vee K_1$ is a $(k+1)$-connected graph

Published on 16 Apr 2026 - 20:50

score 565 · Answer 10 · 2026-04-16 15:47:53

565

Views

Planar graphs and connectivity

Published on 16 Apr 2026 - 15:47

score 911 · Answer 11 · 2026-04-11 22:44:47

911

Views

cardinality of maximum antichains in power set posets

Published on 11 Apr 2026 - 22:44

score 378 · Answer 12 · 2026-04-15 12:05:54

378

Views

Show that if $S$ is a vertex cut of cardinality $\kappa (G)$, then $G-S$ has at most $t$ components

Published on 15 Apr 2026 - 12:05

score 7.1k · Answer 13 · 2026-04-16 18:17:06

7.1k

Views

What is a fundamental cycle of a graph?

Published on 16 Apr 2026 - 18:17

score 524 · Answer 14 · 2026-04-14 11:00:06

524

Views

is there a relation between regular graphs and power set graphs?

Published on 14 Apr 2026 - 11:00

score 1.3k · Answer 15 · 2026-04-18 12:59:21

1.3k

Views

Prove that if $G$ is $k$-edge connected, then $G \bigvee K_1$ is $k+1$-edge connected.

Published on 18 Apr 2026 - 12:59

List Question

Covering one part of a bipartite set

Channel Capacity of a Cycle Graph

Let $H$ be the graph formed by adding a new vertex $w$ of degree $k$ and adjacent to each of $v_1,v_2,...v_k$. Show that $\kappa (H)=k$

Is this dot puzzle solvable?

Find correspondences of nodes between two graphs

Least squares problem equivalent to solving Poisson problem for graph embedding given edge lengths

Isomorphism between graphs with coloured edges

Show that there exists a sequence $T=T_0,T_1,...,T_k=T'$ of spanning trees of $G$ such that $T_i$ and $T_{i+1}$ have $n-2$ edges in common

Prove that if $G$ is a $k$-connected graph, then $G \vee K_1$ is a $(k+1)$-connected graph

Planar graphs and connectivity

cardinality of maximum antichains in power set posets

Show that if $S$ is a vertex cut of cardinality $\kappa (G)$, then $G-S$ has at most $t$ components

What is a fundamental cycle of a graph?

is there a relation between regular graphs and power set graphs?

Prove that if $G$ is $k$-edge connected, then $G \bigvee K_1$ is $k+1$-edge connected.

Trending Questions

Popular # Hahtags

Popular Questions