Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with graphs
Search options not deleted
user 7165
Questions about graphs, discrete structures of nodes which are connected by edges, including trees and graphs with weighted edges.
19
votes
1
answer
499
views
Number of Hamiltonian cycles on a Sierpiński graph
(Please also see the above link for the definition and pictures of Sierpinski-graphs)
I have found $C(n)$, but I must have messed up something, because my solution does not match the given value $C(5) … Even if it seems lengthy, the thoughts become trivial if you look at the graphs while following.
(a) In a given graph $S_n$ call the outer corners $A,B,C$. …
- 22.8k