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 13822
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
1
answer
491
views
$k$-connectivity of a geometric random graph
Is there any result that relates the minimum degree of a geometric random graph to its k-vertex connectivity? I read papers where they pose the condition $$d_{\rm min} \geq k$$
to imply that the graph …
- 241
2
votes
2
answers
404
views
Multigraphs and Social Network Analysis
I am interested about Social Network Analysis (SNA) with multiple links between pairs of nodes. I'm not aware of works in this area, and I am trying to find any reference in these regards.
In parti …
- 241
11
votes
1
answer
434
views
(almost) statistical independence of nodes degrees in a graph
Wireless networks are typically modeled as random geometric graphs. The number of nodes $N$ in the network is drawn from a Poisson distribution with intensity $\lambda$
$$P(N = n) = \frac{\lambda^n …
- 241