Question

If $G$ is a graph with at least one cut-vertex, then at least $2$ of the blocks of $G$ contain exactly $1$ cut-vertex

score 27 · Answer 1 · 2021-05-06 18:57:52

27

Views

If $G$ is a graph with at least one cut-vertex, then at least $2$ of the blocks of $G$ contain exactly $1$ cut-vertex

Published on 06 May 2021 - 18:57

score 544 · Answer 2 · 2021-05-07 01:45:35

544

Views

Is there a way to know how many non-isomorphic spanning trees there are for a graph?

Published on 07 May 2021 - 1:45

score 182 · Answer 3 · 2021-05-07 13:31:25

182

Views

Maximum number of arcs of a digraph that is unilaterally connected but not strongly connected

Published on 07 May 2021 - 13:31

score 239 · Answer 4 · 2021-05-07 16:48:31

239

Views

Prove that $G$ is a block if and only if given a vertex and an edge of $G$ there exists a cycle containing them.

Published on 07 May 2021 - 16:48

score 237 · Answer 5 · 2026-03-26 10:58:39

237

Views

Connected components of infinite graph from adjacency matrix

Published on 26 Mar 2026 - 10:58

score 146 · Answer 6 · 2021-06-04 13:00:01

146

Views

Show that following Graph is connected

Published on 04 Jun 2021 - 13:00

score 83 · Answer 7 · 2021-06-16 16:33:30

83

Views

let $G$=$(V,E)$ be a connected, d- regular bigraph. Prove that for any v, $G'$ = $G$ \ ${v}$ is connected.

Published on 16 Jun 2021 - 16:33

score 185 · Answer 8 · 2021-06-17 01:22:46

185

Views

Proving a lower Bound on Chromatic Number $\chi (G) > 2k$ contains a $k-$connected Subgraph

Published on 17 Jun 2021 - 1:22

score 123 · Answer 9 · 2021-06-18 01:59:51

123

Views

A graph $G=(V,E)$ is connected and its edge $e$ lies on a cycle. Prove that the graph $G^{'} = (V,E-\{e\})$ is connected.

Published on 18 Jun 2021 - 1:59

score 71 · Answer 10 · 2026-03-25 07:44:37

71

Views

Vertex sets separated only by infinitely many vertices imply an infinite number of disjoint paths between them.

Published on 25 Mar 2026 - 7:44

score 209 · Answer 11 · 2021-06-25 18:53:02

209

Views

Difficulty in understanding the proof of "The centre of every connected graph $G$ is a subgraph of some block of $G$"

Published on 25 Jun 2021 - 18:53

score 26 · Answer 12 · 2021-07-08 15:06:52

If a graph with minimal degree greater than 1 has two components then performing a 2-switch with one pair in each component yields a connected graph

score 575 · Answer 13 · 2021-07-14 08:33:20

575

Views

Prove or disprove: A connected undirected Graph G has no Bridge/cut-edge if G is 2k-regular

Published on 14 Jul 2021 - 8:33

score 190 · Answer 14 · 2021-07-16 22:21:31

190

Views

Maximum number of edges in a graph satisfying conditions

Published on 16 Jul 2021 - 22:21

score 543 · Answer 15 · 2021-07-21 09:56:51

543

Views

Prove the pseudo k-regular bipartite graphs has a perfect matching

Published on 21 Jul 2021 - 9:56

List Question

If $G$ is a graph with at least one cut-vertex, then at least $2$ of the blocks of $G$ contain exactly $1$ cut-vertex

Is there a way to know how many non-isomorphic spanning trees there are for a graph?

Maximum number of arcs of a digraph that is unilaterally connected but not strongly connected

Prove that $G$ is a block if and only if given a vertex and an edge of $G$ there exists a cycle containing them.

Connected components of infinite graph from adjacency matrix

Show that following Graph is connected

let $G$=$(V,E)$ be a connected, d- regular bigraph. Prove that for any v, $G'$ = $G$ \ ${v}$ is connected.

Proving a lower Bound on Chromatic Number $\chi (G) > 2k$ contains a $k-$connected Subgraph

A graph $G=(V,E)$ is connected and its edge $e$ lies on a cycle. Prove that the graph $G^{'} = (V,E-\{e\})$ is connected.

Vertex sets separated only by infinitely many vertices imply an infinite number of disjoint paths between them.

Difficulty in understanding the proof of "The centre of every connected graph $G$ is a subgraph of some block of $G$"

If a graph with minimal degree greater than 1 has two components then performing a 2-switch with one pair in each component yields a connected graph

Prove or disprove: A connected undirected Graph G has no Bridge/cut-edge if G is 2k-regular

Maximum number of edges in a graph satisfying conditions

Prove the pseudo k-regular bipartite graphs has a perfect matching

Trending Questions

Popular # Hahtags

Popular Questions