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 graph-reconstruction
Search options questions only
not deleted
user 19885
Questions related to graph reconstruction, the problem of reconstructing a graph from a set or deck (multiset) of subgraphs.
4
votes
0
answers
85
views
Determined labels and reconstruction conjecture
In the reconstruction conjecture $(RC)$, if we know the $k$, $0\leq k \leq n$ labels of the vertices, then $RC$ is true.
Do we know the minimum $k$ that the above statement is true?
Do we have any res …
- 4,784
4
votes
1
answer
89
views
From equivalent graphs to isomorphic one- Reconstruction Conjecture
Suppose we are working with connected simple graphs.
We say the graph $G$ and $H$ are equivalent if for any spanning tree $T_G$ in $G$ there is an spanning tree $T_H$ in $H$ such that $T_G$ is isomorp …
- 4,784
4
votes
0
answers
158
views
Relation between two conjectures on reconstruction of graphs
In spectral graph theory, there is a conjecture that claims: Almost every graph is determined by its adjacency spectrum ($DS$). This conjecture belongs to professor Willem Haemers.
Also, we have a res …
- 4,784