| bio | website | |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 1 year, 6 months |
| seen | Feb 13 at 18:36 | |
| stats | profile views | 7 |
|
Jan 28 |
awarded | Supporter |
|
Jan 28 |
accepted | Graph with multiple Eulerian trails/circuits. |
|
Jan 4 |
asked | Graph with multiple Eulerian trails/circuits. |
|
Dec 30 |
awarded | Scholar |
|
Dec 30 |
accepted | Walks and paths in a graph |
|
Jul 26 |
asked | What is the maximum possible number of k-length geodesics in an n-vertex connected graph? |
|
Jun 17 |
awarded | Editor |
|
Jun 17 |
revised |
Similarity between two nPn permutations of the same set. added 4 characters in body |
|
Jun 17 |
comment |
Similarity between two nPn permutations of the same set. Yes, exactly. But how to quantify it? I search on the Internet, and found that one can think in terms of counting the number of "shift" operations it would take to convert one permutation into the other--something similar to Hamming distance. |
|
Jun 17 |
awarded | Student |
|
Jun 17 |
asked | Similarity between two nPn permutations of the same set. |
|
Nov 24 |
asked | Walks and paths in a graph |