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 spectral-graph-theory
Search options not deleted
user 10881
Questions related to the spectrum of graphs, defined using one of the possible variants of the discrete Laplace operator or Laplacian matrix. See https://en.wikipedia.org/wiki/Discrete_Laplace_operator
4
votes
How can I prove that a particular family of graphs is integral?
As a service, here is a sage program.
def G(n, k):
"""
Mathoverflow Question 159022
"""
vertices = Words(range(k + 1), n)
vertices = [w for w in vertices if w.count(ZZ(0)) == 1]
…
- 3,597
2
votes
Number of trees with the same matching number
This can be done using the canonical coloring of vertices of trees into 3 colors that can be found in
J. Zito, "The structure and maximum number of maximum independent sets in trees"
S. Coulomb and …
- 3,597