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 141969
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.
4
votes
2
answers
599
views
Co-trees of a simple graph
Consider fundamental cycles (say $k$ of them) of a specific spanning tree of a simple graph (with $m$ edges) which is also connected and has no one-edge bonds.
Make the graph directed (in an arbitrary …
- 419
1
vote
Co-trees of a simple graph
Consider 2 different spanning trees of the graph, and the corresponding cotrees and fundamental cycles. Then $$C_2=C_2|S_1*C_1$$ spells out the algebraic details of the following well-known fact: ever …
- 419
0
votes
0
answers
417
views
Linear independence of vectors in Graph Theory
I have poste this question on StackExchange but there were no takers - would I be luckier on this site?
Most of this is well known, so let me just restate the corresponding Math:
Given a connected, di …
- 419