Spectral Analysis of Growing Graphs pp 79-99 | Cite as
Method of Quantum Decomposition
Chapter
First Online:
Abstract
Let \(G=(V,E)\) be a connected graph with a distinguished vertex \(o\in V\), often called a root.
Keywords
Adjacency Matrix Homogeneous Tree Intersection Array Infinite Graph Johnson Graph
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Copyright information
© The Author(s) 2017