Studies in Applied Mathematics · 2003 · 25 citations · 4 references
Natural SciencesComputer ScienceCombinatoricsComputational GeometryGraph VisualizationEigenvalue ProblemsGraph Theory
We study a family of trees with degree k at all interior nodes and degree 1 at boundary nodes. The eigenvalues of the adjacency matrix have high multiplicities. As the trees grow, the graphs of those eigenvalues approach a piecewise‐constant “Cantor function.” For each value of , we will find the fraction of the eigenvalues that are given by .
4
Collective dynamics of ‘small-world’ networks
Duncan J. Watts, Steven H. Strogatz · Nature · 1998 · 43.2K citations
Choice Reviews Online · 1994 · 574 citations · Full text
Theory of monomer-dimer systems
Ole J. Heilmann, Élliott H. Lieb · Communications in Mathematical Physics · 1972 · 510 citations