Principal eigenvectors of irregular graphs

MaRDI QIDQ3497899zbMATH OpenFDO

Authors Sebastian Cioaba, D. A. Gregory

Publication date 28 May 2008

Full work available at URL https://eudml.org/doc/129119

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

eigenvectorsirregular graphspectral radius

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Recommendations

• On maximal entries in the principal eigenvector of graphs
• ON SOME SPECTRAL PROPERTIES OF GRAPHS IN TERMS OF THEIR MAXIMUM MATCHINGS AND MINIMUM VERTEX COVERS
• Characterizing graphs of maximum principal ratio
• The maximum principal ratio of graphs
• On the adjacency matrix of graphs: principal eigenvector versus degree vector

Cited in

(41)

• Principal eigenvectors and spectral radii of uniform hypergraphs
• Complementarity eigenvalue analysis of connected graphs
• Bounds on maximal and minimal entries of the \(p\)-normalized principal eigenvector of the distance and distance signless Laplacian matrices of graphs
• On least eigenvalues and least eigenvectors of real symmetric matrices and graphs
• On maximal entries in the principal eigenvector of graphs
• Principal eigenvector of the signless Laplacian matrix
• Measure-theoretic bounds on the spectral radius of graphs from walks
• Proof of a conjecture on communicability distance sum index of graphs
• A conjecture on the spectral radius of graphs
• Unimodality of principal eigenvector and its applications
• On cardinality of complementarity spectra of connected graphs
• A few examples and counterexamples in spectral graph theory
• The kite graph is determined by its adjacency spectrum
• Three conjectures in extremal spectral graph theory
• The eigenvectors to the \(p\)-spectral radius of general hypergraphs
• Maximum principal ratio of the signless Laplacian of graphs
• On the adjacency matrix of graphs: principal eigenvector versus degree vector
• On the principal eigenvectors of uniform hypergraphs
• Bounds for the spectral radius of a graph when nodes are removed
• The efficiency and stability of R\&D networks
• Spectral and graph-theoretic bounds on steady-state-probability estimation performance for an ergodic Markov chain
• Spectral radius of graphs
• Characterizing graphs of maximum principal ratio
• Bounds on the entries of the principal eigenvector of the distance signless Laplacian matrix
• Principal eigenvectors of general hypergraphs
• Bounds for generalized distance spectral radius and the entries of the principal eigenvector
• ON SOME SPECTRAL PROPERTIES OF GRAPHS IN TERMS OF THEIR MAXIMUM MATCHINGS AND MINIMUM VERTEX COVERS
• New results on -spectral radius of graphs
• Complementarity eigenvalues and graph determination
• A complete solution to the Cvetković–Rowlinson conjecture
• Estimating distance between an eigenvalue of a signed graph and the spectrum of an induced subgraph
• The maximum principal ratio of graphs
• On irregularity indices and main eigenvalues of graphs and their applicability
• On the stability of the principal ratio
• New results on complementarity spectra of connected graphs
• Comparing eigenvector and degree dispersion with the principal ratio of a graph
• A unified framework for the expander mixing lemma for irregular graphs and its applications
• Principal eigenvectors in hypergraph Turán problems
• On estimation of extremal entries of the principal eigenvector of a graph
• The least balanced graphs and trees
• Extreme values of the stationary distribution of random walks on directed graphs

This page was built for publication: Principal eigenvectors of irregular graphs

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