Principal eigenvectors of irregular graphs
From MaRDI portal
Publication:3497899
zbMATH Open1142.05337MaRDI QIDQ3497899FDOQ3497899
Authors: Sebastian Cioaba, D. A. Gregory 
Publication date: 28 May 2008
Full work available at URL: https://eudml.org/doc/129119
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
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
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)
Cited In (38)
- Principal eigenvector of the signless Laplacian matrix
- New results on \(\alpha \)-spectral radius of graphs
- On the stability of the principal ratio
- A conjecture on the spectral radius of graphs
- Bounds for the spectral radius of a graph when nodes are removed
- On cardinality of complementarity spectra of connected graphs
- The kite graph is determined by its adjacency spectrum
- The efficiency and stability of R\&D networks
- Spectral and graph-theoretic bounds on steady-state-probability estimation performance for an ergodic Markov chain
- The maximum principal ratio of graphs
- New results on complementarity spectra of connected graphs
- Principal eigenvectors and spectral radii of uniform hypergraphs
- Proof of a conjecture on communicability distance sum index of graphs
- Extreme values of the stationary distribution of random walks on directed graphs
- A few examples and counterexamples in spectral graph theory
- Bounds on maximal and minimal entries of the \(p\)-normalized principal eigenvector of the distance and distance signless Laplacian matrices of graphs
- Measure-theoretic bounds on the spectral radius of graphs from walks
- A unified framework for the expander mixing lemma for irregular graphs and its applications
- Three conjectures in extremal spectral graph theory
- Bounds for generalized distance spectral radius and the entries of the principal eigenvector
- Characterizing graphs of maximum principal ratio
- A complete solution to the Cvetković–Rowlinson conjecture
- Comparing eigenvector and degree dispersion with the principal ratio of a graph
- On the principal eigenvectors of uniform hypergraphs
- Principal eigenvectors of general hypergraphs
- Bounds on the entries of the principal eigenvector of the distance signless Laplacian matrix
- On the adjacency matrix of graphs: principal eigenvector versus degree vector
- On least eigenvalues and least eigenvectors of real symmetric matrices and graphs
- Maximum principal ratio of the signless Laplacian of graphs
- Estimating distance between an eigenvalue of a signed graph and the spectrum of an induced subgraph
- The eigenvectors to the \(p\)-spectral radius of general hypergraphs
- Complementarity eigenvalues and graph determination
- ON SOME SPECTRAL PROPERTIES OF GRAPHS IN TERMS OF THEIR MAXIMUM MATCHINGS AND MINIMUM VERTEX COVERS
- Spectral radius of graphs
- Complementarity eigenvalue analysis of connected graphs
- Unimodality of principal eigenvector and its applications
- On maximal entries in the principal eigenvector of graphs
- On irregularity indices and main eigenvalues of graphs and their applicability
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)
