Related Experiment Videos
An eigenvector interlacing property of graphs that arise from trees by Schur complementation of the Laplacian
Alexander R Griffing1, Benjamin R Lynch, Eric A Stone
1North Carolina State University.
Abstract:
The literature is replete with rich connections between the structure of a graph G = (V, E) and the spectral properties of its Laplacian matrix L. This paper establishes similar connections between the structure of G and the Laplacian L* of a second graph G*. Our interest lies in L* that can be obtained from L by Schur complementation, in which case we say that G* is partially-supplied with respect to G. In particular, we specialize to where G is a tree with points of articulation r ∈ R and consider the partially-supplied graph G* derived from G by taking the Schur complement with respect to R in L. Our results characterize how the eigenvectors of the Laplacian of G* relate to each other and to the structure of the tree.
Related Concept Videos
Vector Algebra: Graphical Method
We use the laws of geometry to construct resultant vectors, followed by trigonometry to find vector magnitudes and directions. For a geometric construction of the sum of two vectors in a plane, we follow the parallelogram rule. Suppose two vectors are at arbitrary positions. Translate either one of...
Vector Algebra: Method of Components
In many applications, the magnitudes and directions of...
Graphs of Polar Equations
Graphical Representation of Inequalities
Properties of Laplace Transform-I
The Linearity property is foundational to the Laplace transform. It states that the transform of a linear combination of functions is equivalent to the same...
Cartesian Vector Notation