| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 417933 | Discrete Applied Mathematics | 2016 | 9 Pages |
Abstract
We use a geometric technique based on embeddings of graphs to provide an explicit formula for the absolute algebraic connectivity and its eigenvectors of double brooms. Besides, we give a polynomial time combinatorial algorithm that computes the absolute algebraic connectivity of a given tree.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Sebastian Richter, Israel Rocha,