List questions from graph-connectivity

Published on 25 Nov 2020 - 19:31

401

Views

Let $G$ a connected graph, and $B(G)$ the set of blocks of $G$, $cv(G)$ the set of cut vertex of $G$

Published on 28 Nov 2020 - 3:23

140

Views

Use a greedy ear decomposition to prove that every 2-connected claw-free graph G has [n(G)/3]

Published on 29 Nov 2020 - 19:20

155

Views

length of common cycle in two k-connected subgraphs of a graph

Published on 30 Nov 2020 - 18:33

167

Views

Let $G$ a $k-$connected graph, then $L(G)$ is $(k-2)-$connected.

Published on 07 Dec 2020 - 19:40

775

Views

Connected $k-$regular graph does not have cut-edge for $k \ge 2$

Published on 08 Dec 2020 - 9:48

78

Views

Detecting graph topology.

Published on 14 Dec 2020 - 12:24

155

Views

Path between vertices with an odd degree

Published on 23 Dec 2020 - 10:03

1.3k

Views

Determine if edge is a bridge in a graph

Published on 29 Dec 2020 - 9:25

594

Views

3- regular connected graph $G$ has independent subgraph $H$ such that $G-H$ is still connected.

Published on 30 Dec 2020 - 16:55

380

Views

A snow of connected components

Published on 16 Jan 2021 - 20:30

499

Views

Prove a graph is cyclic

Published on 18 Jan 2021 - 13:54

184

Views

Graph theory connected graph

Published on 19 Jan 2021 - 16:12

374

Views

Just one vertex not in a cycle means there is a vertex cut?

Published on 20 Jan 2021 - 3:31

179

Views

Is node connectivity simply the smallest node degree in the network?

Published on 31 Jan 2021 - 20:31

List Question

I dont understand Mengers Theorem (graph theory)

Let $G$ a connected graph, and $B(G)$ the set of blocks of $G$, $cv(G)$ the set of cut vertex of $G$

Use a greedy ear decomposition to prove that every 2-connected claw-free graph G has [n(G)/3]

length of common cycle in two k-connected subgraphs of a graph

Let $G$ a $k-$connected graph, then $L(G)$ is $(k-2)-$connected.

Connected $k-$regular graph does not have cut-edge for $k \ge 2$

Detecting graph topology.

Path between vertices with an odd degree

Determine if edge is a bridge in a graph

3- regular connected graph $G$ has independent subgraph $H$ such that $G-H$ is still connected.

A snow of connected components

Prove a graph is cyclic

Graph theory connected graph

Just one vertex not in a cycle means there is a vertex cut?

Is node connectivity simply the smallest node degree in the network?

Trending Questions

Popular # Hahtags

Popular Questions