Question

Let $A$ be a primitive $(0, 1)$-matrix of order $n$, and $\cdots$ then $\text{exp} (A) \leq n + l(n − 2).$

score 34 · Answer 1 · 2018-09-02 02:35:25

34

Views

Let $A$ be a primitive $(0, 1)$-matrix of order $n$, and $\cdots$ then $\text{exp} (A) \leq n + l(n − 2).$

Published on 02 Sep 2018 - 2:35

score 63 · Answer 2 · 2018-09-02 11:21:57

63

Views

Real number 1-Vertex labelling without injectivity

Published on 02 Sep 2018 - 11:21

score 437 · Answer 3 · 2026-03-26 02:41:40

437

Views

Frogs jumping on trees

Published on 26 Mar 2026 - 2:41

score 824 · Answer 4 · 2026-03-25 06:06:27

824

Views

Every graph $G$ with $d(G) \ge 4k$ has a $(k + 1)$-connected subgraph $H$ such that $\epsilon (H) > \epsilon(G) − k$.

Published on 25 Mar 2026 - 6:06

score 58 · Answer 5 · 2026-03-25 14:26:00

58

Views

Is the the derivation of the following motion equation correct?

Published on 25 Mar 2026 - 14:26

score 465 · Answer 6 · 2018-09-03 15:09:37

465

Views

What is the intuition behind this question (Graph theory with applications, Bondy and Murty Q1.2.9)

Published on 03 Sep 2018 - 15:09

score 304 · Answer 7 · 2026-03-25 11:57:19

304

Views

Do there exist $d$-regular expander families with Cheeger constant greater than $d/2$?

Published on 25 Mar 2026 - 11:57

score 84 · Answer 8 · 2026-03-29 21:19:48

84

Views

Where can I find out more about the nature of holes in plane regions?

Published on 29 Mar 2026 - 21:19

score 175 · Answer 9 · 2026-03-24 23:55:13

175

Views

Proof that $t(n)=\frac{r}{n-1}$ is a threshold function in random G(n,p) graph

Published on 24 Mar 2026 - 23:55

score 108 · Answer 10 · 2018-09-04 07:14:43

108

Views

A tricky subset counting problem

Published on 04 Sep 2018 - 7:14

score 1.2k · Answer 11 · 2026-03-25 15:59:25

1.2k

Views

Proof that the Laplacian matrix of a complex weighted graph is positive semi-definite.

Published on 25 Mar 2026 - 15:59

score 75 · Answer 12 · 2018-09-04 09:29:00

75

Views

Black-White Grid coluring without cycles

Published on 04 Sep 2018 - 9:29

score 277 · Answer 13 · 2018-09-04 10:57:57

277

Views

To construct a graph using path graph $P_4$

Published on 04 Sep 2018 - 10:57

score 47 · Answer 14 · 2026-03-26 01:28:14

47

Views

Representing a map of traffic as a matrix or vector

Published on 26 Mar 2026 - 1:28

score 418 · Answer 15 · 2026-02-23 04:52:13

418

Views

Properly stating a decision problem for a Hamiltonian cycle problem

Published on 23 Feb 2026 - 4:52

List Question

Let $A$ be a primitive $(0, 1)$-matrix of order $n$, and $\cdots$ then $\text{exp} (A) \leq n + l(n − 2).$

Real number 1-Vertex labelling without injectivity

Frogs jumping on trees

Every graph $G$ with $d(G) \ge 4k$ has a $(k + 1)$-connected subgraph $H$ such that $\epsilon (H) > \epsilon(G) − k$.

Is the the derivation of the following motion equation correct?

What is the intuition behind this question (Graph theory with applications, Bondy and Murty Q1.2.9)

Do there exist $d$-regular expander families with Cheeger constant greater than $d/2$?

Where can I find out more about the nature of holes in plane regions?

Proof that $t(n)=\frac{r}{n-1}$ is a threshold function in random G(n,p) graph

A tricky subset counting problem

Proof that the Laplacian matrix of a complex weighted graph is positive semi-definite.

Black-White Grid coluring without cycles

To construct a graph using path graph $P_4$

Representing a map of traffic as a matrix or vector

Properly stating a decision problem for a Hamiltonian cycle problem

Trending Questions

Popular # Hahtags

Popular Questions