Question

Show that the set of Endormorphism of a given graph is equal to the set of Automorphism.

score 39 · Answer 1 · 2026-03-25 13:57:00

39

Views

Show that the set of Endormorphism of a given graph is equal to the set of Automorphism.

Published on 25 Mar 2026 - 13:57

score 50 · Answer 2 · 2018-12-27 10:10:29

50

Views

Pancake problem

Published on 27 Dec 2018 - 10:10

score 142 · Answer 3 · 2018-12-27 17:32:49

142

Views

How to formalize a path in a directed graph?

Published on 27 Dec 2018 - 17:32

score 212 · Answer 4 · 2026-03-25 06:19:24

212

Views

Probability that we choose even edges for a vertex

Published on 25 Mar 2026 - 6:19

score 380 · Answer 5 · 2026-03-27 04:38:33

380

Views

Is there an algorithm to find the lengths of all paths from a given vertice that can run in polynomial time?

Published on 27 Mar 2026 - 4:38

score 966 · Answer 6 · 2026-03-25 01:15:00

966

Views

A good book to learn graph algorithms

Published on 25 Mar 2026 - 1:15

score 200 · Answer 7 · 2026-03-25 13:59:04

200

Views

Are Cayley Graphs weakly or strongly connected?

Published on 25 Mar 2026 - 13:59

score 268 · Answer 8 · 2026-03-25 17:31:56

268

Views

Equivalent characterization of Eulerian circuits

Published on 25 Mar 2026 - 17:31

score 927 · Answer 9 · 2026-03-26 06:29:57

927

Views

Is there any relation between random walk and eigen-vectors of adjacency matrix other than the first one in graph?

Published on 26 Mar 2026 - 6:29

score 102 · Answer 10 · 2026-03-25 07:49:12

102

Views

Proof of a Lemma for Saturated Non-Factorizable Graphs

Published on 25 Mar 2026 - 7:49

score 665 · Answer 11 · 2026-03-25 20:36:12

665

Views

Calculate the maximum number of edges of a graph without two disjoint $K_3$

Published on 25 Mar 2026 - 20:36

score 43 · Answer 12 · 2026-04-01 13:57:00

43

Views

Any standard name for this graph?

Published on 01 Apr 2026 - 13:57

score 624 · Answer 13 · 2026-03-25 01:35:27

624

Views

Characteristic Path Length for a 1-lattices

Published on 25 Mar 2026 - 1:35

score 39 · Answer 14 · 2026-03-31 03:57:04

39

Views

finding k triangles that connect all vertices with minimum weight in a undirected complete graph

Published on 31 Mar 2026 - 3:57

score 34 · Answer 15 · 2026-03-26 01:27:31

34

Views

Doubt regarding the variable by which time complexity is measured

Published on 26 Mar 2026 - 1:27

List Question

Show that the set of Endormorphism of a given graph is equal to the set of Automorphism.

Pancake problem

How to formalize a path in a directed graph?

Probability that we choose even edges for a vertex

Is there an algorithm to find the lengths of all paths from a given vertice that can run in polynomial time?

A good book to learn graph algorithms

Are Cayley Graphs weakly or strongly connected?

Equivalent characterization of Eulerian circuits

Is there any relation between random walk and eigen-vectors of adjacency matrix other than the first one in graph?

Proof of a Lemma for Saturated Non-Factorizable Graphs

Calculate the maximum number of edges of a graph without two disjoint $K_3$

Any standard name for this graph?

Characteristic Path Length for a 1-lattices

finding k triangles that connect all vertices with minimum weight in a undirected complete graph

Doubt regarding the variable by which time complexity is measured

Trending Questions

Popular # Hahtags

Popular Questions