Some results about the connectivity of trees
The second smallest Laplacian eigenvalue of a graph G is called algebraic connectivity, denoted a(G). The ordering of trees via this graph invariant is frequently studied in the literature. In this paper, we present a new invariant, the Internal Degree Sequence (IDS), that also supports an accurate...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Sociedade Brasileira de Pesquisa Operacional
2013-04-01
|
| Series: | Pesquisa Operacional |
| Subjects: | |
| Online Access: | http://www.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382013000100008 |