Question

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

score 1.4k · Answer 1 · 2026-05-05 06:19:19

1.4k

Views

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

Published on 05 May 2026 - 6:19

score 1.9k · Answer 2 · 2026-04-16 08:38:35

1.9k

Views

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

Published on 16 Apr 2026 - 8:38

score 224 · Answer 3 · 2026-04-14 21:51:00

224

Views

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

Published on 14 Apr 2026 - 21:51

score 2.4k · Answer 4 · 2026-04-15 17:42:59

2.4k

Views

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

Published on 15 Apr 2026 - 17:42

score 677 · Answer 5 · 2026-05-04 12:55:26

677

Views

Graph theory: Isomorphic and Complement graphs

Published on 04 May 2026 - 12:55

score 91 · Answer 6 · 2026-05-05 03:36:03

91

Views

Group associated with graphs

Published on 05 May 2026 - 3:36

score 47 · Answer 7 · 2026-04-15 21:21:09

47

Views

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

Published on 15 Apr 2026 - 21:21

score 237 · Answer 8 · 2026-04-29 12:20:31

237

Views

How to uniquely label a connected graph?

Published on 29 Apr 2026 - 12:20

score 62 · Answer 9 · 2026-05-10 13:47:41

62

Views

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

Published on 10 May 2026 - 13:47

score 722 · Answer 10 · 2026-04-29 12:18:46

722

Views

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

Published on 29 Apr 2026 - 12:18

score 3k · Answer 11 · 2026-04-29 12:06:16

3k

Views

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

Published on 29 Apr 2026 - 12:06

score 82 · Answer 12 · 2026-04-29 12:52:41

82

Views

Circulant adjacency matrix

Published on 29 Apr 2026 - 12:52

score 259 · Answer 13 · 2026-04-12 17:56:56

259

Views

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

Published on 12 Apr 2026 - 17:56

score 74 · Answer 14 · 2026-05-04 04:07:15

74

Views

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

Published on 04 May 2026 - 4:07

score 65 · Answer 15 · 2026-05-10 12:07:41

65

Views

Common neighborhood property

Published on 10 May 2026 - 12:07

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