Question

Maximum Number of Edges in a Graph Without a Cycle of length $4$

score 1.4k · Answer 1 · 2026-03-20 03:23:42

1.4k

Views

Maximum Number of Edges in a Graph Without a Cycle of length $4$

Published on 20 Mar 2026 - 3:23

score 1.9k · Answer 2 · 2018-01-19 01:48:27

1.9k

Views

Prove that if $diam(G) = 3$ for a regular graph G, then $diam(\bar{G}) = 2.$

Published on 19 Jan 2018 - 1:48

score 221 · Answer 3 · 2018-01-19 07:54:46

221

Views

prove that G has a circle with a length of 4.

Published on 19 Jan 2018 - 7:54

score 2.4k · Answer 4 · 2018-01-19 08:58:24

2.4k

Views

How many Graphs with 5 vertices (a, b, c, d, e) have only one vertex with rank 4?

Published on 19 Jan 2018 - 8:58

score 671 · Answer 5 · 2026-03-22 17:19:14

671

Views

Graph theory: Isomorphic and Complement graphs

Published on 22 Mar 2026 - 17:19

score 84 · Answer 6 · 2026-03-21 22:40:13

84

Views

Group associated with graphs

Published on 21 Mar 2026 - 22:40

score 44 · Answer 7 · 2018-01-19 12:19:28

44

Views

What is the Number of Non Isomorphic Spanning trees of $K_n$? (Complete graph of size n)

Published on 19 Jan 2018 - 12:19

score 226 · Answer 8 · 2026-03-20 11:41:37

226

Views

How to uniquely label a connected graph?

Published on 20 Mar 2026 - 11:41

score 57 · Answer 9 · 2018-01-20 05:44:30

57

Views

How to label a graph with restricted difference between adjacent vertices?

Published on 20 Jan 2018 - 5:44

score 711 · Answer 10 · 2026-03-20 08:23:12

711

Views

What precisely is the Friendship Paradox (and is Wikipedia wrong?)

Published on 20 Mar 2026 - 8:23

score 3k · Answer 11 · 2026-03-20 07:59:24

3k

Views

Minimum number of edges that have to be removed in a graph to make it acyclic

Published on 20 Mar 2026 - 7:59

score 76 · Answer 12 · 2026-03-22 19:48:44

76

Views

Circulant adjacency matrix

Published on 22 Mar 2026 - 19:48

score 256 · Answer 13 · 2018-01-22 03:21:23

256

Views

Is there an example of a finite regular (weakly) connected digraph which is not strongly connected?

Published on 22 Jan 2018 - 3:21

score 62 · Answer 14 · 2026-03-20 03:10:21

62

Views

Is there a name for a set of elements that violate the conditions of the marriage theorem?

Published on 20 Mar 2026 - 3:10

score 61 · Answer 15 · 2026-03-21 21:56:06

61

Views

Common neighborhood property

Published on 21 Mar 2026 - 21:56

List Question

Maximum Number of Edges in a Graph Without a Cycle of length $4$

Prove that if $diam(G) = 3$ for a regular graph G, then $diam(\bar{G}) = 2.$

prove that G has a circle with a length of 4.

How many Graphs with 5 vertices (a, b, c, d, e) have only one vertex with rank 4?

Graph theory: Isomorphic and Complement graphs

Group associated with graphs

What is the Number of Non Isomorphic Spanning trees of $K_n$? (Complete graph of size n)

How to uniquely label a connected graph?

How to label a graph with restricted difference between adjacent vertices?

What precisely is the Friendship Paradox (and is Wikipedia wrong?)

Minimum number of edges that have to be removed in a graph to make it acyclic

Circulant adjacency matrix

Is there an example of a finite regular (weakly) connected digraph which is not strongly connected?

Is there a name for a set of elements that violate the conditions of the marriage theorem?

Common neighborhood property

Trending Questions

Popular # Hahtags

Popular Questions