Question

A question regarding a $k$-connected graph

score 557 · Answer 1 · 2026-03-25 12:52:49

557

Views

A question regarding a $k$-connected graph

Published on 25 Mar 2026 - 12:52

score 181 · Answer 2 · 2026-03-25 17:37:04

181

Views

Is this an equivalent definition for connectivity in graphs?

Published on 25 Mar 2026 - 17:37

score 134 · Answer 3 · 2026-05-10 22:54:40

134

Views

vertex connectivity proof

Published on 10 May 2026 - 22:54

score 738 · Answer 4 · 2026-03-25 12:55:39

738

Views

Proving that articulation points lay on all paths between two vertices

Published on 25 Mar 2026 - 12:55

score 204 · Answer 5 · 2026-03-25 14:24:41

204

Views

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

Published on 25 Mar 2026 - 14:24

score 256 · Answer 6 · 2026-03-25 12:54:11

256

Views

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

Published on 25 Mar 2026 - 12:54

score 57 · Answer 7 · 2026-03-25 14:22:34

57

Views

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

Published on 25 Mar 2026 - 14:22

score 939 · Answer 8 · 2026-03-25 12:46:38

939

Views

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

Published on 25 Mar 2026 - 12:46

score 522 · Answer 9 · 2026-03-25 12:54:39

522

Views

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

Published on 25 Mar 2026 - 12:54

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 50 · Answer 11 · 2026-03-25 12:50:53

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 61 · Answer 12 · 2026-03-25 16:06:57

61

Views

How to prove this graph is connected?

Published on 25 Mar 2026 - 16:06

score 138 · Answer 13 · 2026-03-25 14:25:48

138

Views

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

Published on 25 Mar 2026 - 14:25

score 59 · Answer 14 · 2026-03-25 12:48:49

59

Views

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

Published on 25 Mar 2026 - 12:48

score 3.4k · Answer 15 · 2026-03-25 12:50:12

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 25 Mar 2026 - 12:50

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