some results about the connectivity of trees
Clicks: 180
ID: 170200
2013
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Emerging Content
30.0
/100
180 views
14 readers
AI Quality Assessment
Not analyzed
Readership in this journal
EmergingRanked #16 of 33 articles by views in t\"urk ya\csam bilimleri dergisi
Most read
Least read
Bar heights use a square-root scale.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
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 evaluation of the connectivity of trees. We compare the IDS with a(G) for all elements in six classes of trees known to have the largest algebraic connectivity and we show that the IDS provides a strict total ordering of the elements of these classes. This result is also proved for a subclass of trees of diameter 4.
| Reference Key |
markenzon2013pesquisasome
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;Lilian Markenzon;Nair Maria Maia de Abreu;Luciana Lee |
| Journal | t\"urk ya\csam bilimleri dergisi |
| Year | 2013 |
| DOI |
DOI not found
|
| URL | |
| Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.