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-theory
Search options not deleted
user 9497
Questions about the branch of combinatorics called graph theory (not to be used for questions concerning the graph of a function). This tag can be further specialized via using it in combination with more specialized tags such as extremal-graph-theory, spectral-graph-theory, algebraic-graph-theory, topological-graph-theory, random-graphs, graph-colorings and several others.
2
votes
Bipartite graphs with prescribed Matching $M$ and genus $g$.
The graph genus problem is NP-hard, so I don't know if this can really be done, at least we don't expect anything to be done quickly.
http://en.wikipedia.org/wiki/Graph_embedding#Computational_comple …
- 81
6
votes
How much linear algebra can be done with graphs?
To answer your first question, you can always interprete vectors as weights on the vertices. In this case, $\lambda$ is an eigenvalue with eigenvector $v$ if for each vertex, the sum of the weights of …
- 81