Question

A question regarding a $k$-connected graph

score 556 · Answer 1 · 2019-12-09 08:05:08

556

Views

A question regarding a $k$-connected graph

Published on 09 Dec 2019 - 8:05

score 180 · Answer 2 · 2019-12-11 06:28:29

180

Views

Is this an equivalent definition for connectivity in graphs?

Published on 11 Dec 2019 - 6:28

score 132 · Answer 3 · 2019-12-28 07:12:47

132

Views

vertex connectivity proof

Published on 28 Dec 2019 - 7:12

score 737 · Answer 4 · 2019-12-30 20:15:35

737

Views

Proving that articulation points lay on all paths between two vertices

Published on 30 Dec 2019 - 20:15

score 203 · Answer 5 · 2020-02-26 22:04:05

203

Views

A problem about the connectivity of vertices that must have the same color for any proper minimal coloring of a graph.

Published on 26 Feb 2020 - 22:04

score 255 · Answer 6 · 2020-03-19 06:36:05

255

Views

Maximum set of edges or vertices that doesn't disconnect graph

Published on 19 Mar 2020 - 6:36

score 56 · Answer 7 · 2020-03-21 18:17:30

56

Views

$G$ is $n$-edge-connected iff $L(G)$ is $n$-connected

Published on 21 Mar 2020 - 18:17

score 938 · Answer 8 · 2020-03-24 01:11:25

938

Views

A connected k-regular bipartite graph is k-connected.

Published on 24 Mar 2020 - 1:11

score 521 · Answer 9 · 2020-03-29 02:12:25

521

Views

k-connected graph, there exists a cycle that contains any 2 edges and any $k-2$ vertices

Published on 29 Mar 2020 - 2:12

score 1.2k · Answer 10 · 2026-03-25 08:09:58

1.2k

Views

Questions related to Laplacian matrix of a Graph

Published on 25 Mar 2026 - 8:09

score 49 · Answer 11 · 2020-05-07 01:51:23

Let $G$ be a non-complete graph of order $n$ and $k$-connected. Show that if S is a vertex cut of cardinality κ(G), then G−S has at most t components

score 60 · Answer 12 · 2020-05-10 18:47:11

60

Views

How to prove this graph is connected?

Published on 10 May 2020 - 18:47

score 137 · Answer 13 · 2020-05-13 03:09:57

137

Views

Prove that $\lambda (G) \leq r/2$ if $\kappa(G) = 1$ of r-regular connected graph $G$ and $r > 1$

Published on 13 May 2020 - 3:09

score 58 · Answer 14 · 2020-05-18 13:55:07

58

Views

remove a vertex of a 2-connected graph without break 2-connected

Published on 18 May 2020 - 13:55

score 3.4k · Answer 15 · 2020-05-19 23:15:05

3.4k

Views

Show that if $G$ is $2-$connected, then for any two vertices $u$ and $v$ there exists a cycle $C$ such that $u, v \in V (C)$

Published on 19 May 2020 - 23:15

List Question

A question regarding a $k$-connected graph

Is this an equivalent definition for connectivity in graphs?

vertex connectivity proof

Proving that articulation points lay on all paths between two vertices

A problem about the connectivity of vertices that must have the same color for any proper minimal coloring of a graph.

Maximum set of edges or vertices that doesn't disconnect graph

$G$ is $n$-edge-connected iff $L(G)$ is $n$-connected

A connected k-regular bipartite graph is k-connected.

k-connected graph, there exists a cycle that contains any 2 edges and any $k-2$ vertices

Questions related to Laplacian matrix of a Graph

Let $G$ be a non-complete graph of order $n$ and $k$-connected. Show that if S is a vertex cut of cardinality κ(G), then G−S has at most t components

How to prove this graph is connected?

Prove that $\lambda (G) \leq r/2$ if $\kappa(G) = 1$ of r-regular connected graph $G$ and $r > 1$

remove a vertex of a 2-connected graph without break 2-connected

Show that if $G$ is $2-$connected, then for any two vertices $u$ and $v$ there exists a cycle $C$ such that $u, v \in V (C)$

Trending Questions

Popular # Hahtags

Popular Questions