Extremal Properties of Graphs and Eigencentrality in Trees with a Given Degree Sequence
From MaRDI portal
Publication:3587533
DOI10.1080/00222500903221563zbMath1231.05136OpenAlexW1974864714MaRDI QIDQ3587533
Anna Torriero, Silvana Stefani, Rosanna Grassi
Publication date: 8 September 2010
Published in: The Journal of Mathematical Sociology (Search for Journal in Brave)
Full work available at URL: http://www.informaworld.com/smpp/content~db=all~content=a920113999~frm=abslink
Related Items (6)
Topological indices of the line graph of subdivision graphs and their Schur-bounds ⋮ Higher order assortativity in complex networks ⋮ Bounds for the Kirchhoff index via majorization techniques ⋮ A majorization method for localizing graph topological indices ⋮ New bounds of degree-based topological indices for some classes of \(c\)-cyclic graphs ⋮ Relating centralities in graphs and the principal eigenvector of its distance matrix
Cites Work
- Unnamed Item
- Extremal trees with given degree sequence for the Randić index
- Closed formulas for the numbers of small independent sets and matchings and an extremal problem for trees
- Matrix Analysis
- Some New Results on the Eigenvector Centrality
- Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications
- Inequalities: theory of majorization and its applications
This page was built for publication: Extremal Properties of Graphs and Eigencentrality in Trees with a Given Degree Sequence