On the adjacency matrix of graphs: principal eigenvector versus degree vector

MaRDI QIDQ2821075zbMATH OpenFDO

Authors Julien Riposo, Carlo Bianca

Publication date 16 September 2016

Published in Nonlinear Studies (Search for Journal in Brave)

Full work available at URL http://www.nonlinearstudies.com/index.php/nonlinear/article/view/1378

zbMATH Keywords

degree vectoregenvectorgraphirreducible matrixspectral radius

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Inequalities involving eigenvalues and eigenvectors (15A42) Stochastic matrices (15B51)

Recommendations

• Principal eigenvectors of irregular graphs
• scientific article; zbMATH DE number 7365978
• On maximal entries in the principal eigenvector of graphs
• Some New Results on the Eigenvector Centrality
• Principal eigenvectors of general hypergraphs

Cited in

(7)

• On maximal entries in the principal eigenvector of graphs
• Majorisations for the eigenvectors of graph-adjacency matrices
• Principal eigenvectors of irregular graphs
• Maximal and minimal entry in the principal eigenvector for the distance matrix of a graph
• Some New Results on the Eigenvector Centrality
• Comparing eigenvector and degree dispersion with the principal ratio of a graph
• Eigenvector components of symmetric, graph-related matrices

This page was built for publication: On the adjacency matrix of graphs: principal eigenvector versus degree vector

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2821075)