Question

How to Show a graph is 3-connected?

score 713 · Answer 1 · 2019-03-14 05:34:35

713

Views

How to Show a graph is 3-connected?

Published on 14 Mar 2019 - 5:34

score 356 · Answer 2 · 2019-03-14 21:38:05

356

Views

Can we have an infinite tree in this graph?

Published on 14 Mar 2019 - 21:38

score 48 · Answer 3 · 2019-03-28 07:06:56

48

Views

Characterization of Block Graphs

Published on 28 Mar 2019 - 7:06

score 327 · Answer 4 · 2019-04-09 03:01:44

327

Views

Show that the number of connected components are less or equal of the degree of vertex in a cut set.

Published on 09 Apr 2019 - 3:01

score 226 · Answer 5 · 2019-04-11 05:02:52

226

Views

Show that if $\kappa(G) \leq 1$ then $\lambda(G) \leq \frac{\Delta(G)}{2}$

Published on 11 Apr 2019 - 5:02

score 41 · Answer 6 · 2019-04-11 09:00:30

41

Views

Question regarding removal of a perfect matching in bridgeless graphs

Published on 11 Apr 2019 - 9:00

score 152 · Answer 7 · 2019-04-15 14:43:06

152

Views

If $G$ is a graph having $p$ vertices and min degree $\delta(G)\ge\frac{p-1}{2}$, then the edge connectivity is $\delta(G)$.

Published on 15 Apr 2019 - 14:43

score 241 · Answer 8 · 2019-04-19 17:25:21

241

Views

Generalization of graph connectivity to edge cases (null graph, singleton graph)

Published on 19 Apr 2019 - 17:25

score 217 · Answer 9 · 2019-04-25 06:03:54

217

Views

Show that if $G$ is $k$-connected and $H$ is $t$-connected then $G+H$ is $(k+t)$-connected

Published on 25 Apr 2019 - 6:03

score 460 · Answer 10 · 2019-05-05 22:54:30

460

Views

A 2-connected graph contains a path passing through all the odd degree vertices

Published on 05 May 2019 - 22:54

score 402 · Answer 11 · 2019-05-15 20:39:01

402

Views

Prove that if a graph is k-connected, then it is also k-edge-connected

Published on 15 May 2019 - 20:39

score 2.8k · Answer 12 · 2019-05-16 04:42:52

2.8k

Views

prove that if $G$ is a graph with $n$ vertices and $\delta(G) \geq (n - 1) / 2$ then $G$ is $\frac{n-1}{2}$-edge-connected

Published on 16 May 2019 - 4:42

score 69 · Answer 13 · 2019-06-04 03:28:24

69

Views

Show that a bridge is incident on a maximum degree vertex

Published on 04 Jun 2019 - 3:28

score 556 · Answer 14 · 2019-06-11 21:50:20

556

Views

Algorithm to compute maximum independent set of graph with maximum block size k with comlexity $O(f(k)\cdot p(|V(G)|)$

Published on 11 Jun 2019 - 21:50

score 178 · Answer 15 · 2019-06-18 11:20:25

178

Views

Place bounds on the chromatic number of G given its maximum number of components

Published on 18 Jun 2019 - 11:20

List Question

How to Show a graph is 3-connected?

Can we have an infinite tree in this graph?

Characterization of Block Graphs

Show that the number of connected components are less or equal of the degree of vertex in a cut set.

Show that if $\kappa(G) \leq 1$ then $\lambda(G) \leq \frac{\Delta(G)}{2}$

Question regarding removal of a perfect matching in bridgeless graphs

If $G$ is a graph having $p$ vertices and min degree $\delta(G)\ge\frac{p-1}{2}$, then the edge connectivity is $\delta(G)$.

Generalization of graph connectivity to edge cases (null graph, singleton graph)

Show that if $G$ is $k$-connected and $H$ is $t$-connected then $G+H$ is $(k+t)$-connected

A 2-connected graph contains a path passing through all the odd degree vertices

Prove that if a graph is k-connected, then it is also k-edge-connected

prove that if $G$ is a graph with $n$ vertices and $\delta(G) \geq (n - 1) / 2$ then $G$ is $\frac{n-1}{2}$-edge-connected

Show that a bridge is incident on a maximum degree vertex

Algorithm to compute maximum independent set of graph with maximum block size k with comlexity $O(f(k)\cdot p(|V(G)|)$

Place bounds on the chromatic number of G given its maximum number of components

Trending Questions

Popular # Hahtags

Popular Questions