Eigenspaces of graphs
From MaRDI portal
algorithmsanglescomplexitycospectral treesmain partmaximal indexperfect matchingPetersen graphspectral graph theoryspectral invariantsspectrumstar basesstar partitionstrongly regular graphs
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph algorithms (graph-theoretic aspects) (05C85)
Recommendations
Cited in
(only showing first 100 items - show all)- Matchings in regular graphs from eigenvalues
- The Laplacian spectral radius of a graph under perturbation
- On certain eigenspaces of cographs
- Returnability in complex directed networks (digraphs)
- On nested split graphs whose second largest eigenvalue is less than 1
- A spectral proof of the uniqueness of a strongly regular graph with parameters (81,20,1,6)
- Unicyclic graphs with exactly two main eigenvalues
- Some characterizations of strongly regular graphs
- Asymptotic results on the spectral radius and the diameter of graphs
- On graphs with multiple eigenvalues
- The alternating and adjacency polynomials, and their relation with the spectra and diameters of graphs
- Laplacian graph eigenvectors
- The maximal exceptional graphs
- On the spectral radius of unicyclic graphs with perfect matchings
- On graphs whose star complement for \(-2\) is a path or a cycle
- The number of walks in a graph
- Hoffman-type identities
- Asymptotic results regarding the number of walks in a graph
- When can the components of NEPS of connected bipartite graphs be almost cospectral?
- The spectral radius of graphs on surfaces
- Maximal graphs and graphs with maximal spectral radius
- Ordering graphs with small index and its application
- On dynamic network security: a random decentering algorithm on graphs
- A class of highly symmetric graphs, symmetric cylindrical constructions and their spectra
- The anti-adjacency matrix of a graph: eccentricity matrix
- On the exponential generating function for non-backtracking walks
- Eigenfunctions supports of minimum cardinality in cubical distance-regular graphs
- On the second minimum algebraic connectivity of the graphs whose complements are trees
- The cost of segregation in (social) networks
- Null decomposition of trees
- The transfer matrices and the capacity of the 2-dimensional (1, )-runlength limited constraint
- Balanced centrality of networks
- Minimum supports of functions on the Hamming graphs with spectral constraints
- On ordinary and signless Laplacian spectral radius of graphs with fixed number of branch vertices
- Unicyclic and bicyclic graphs with exactly three \(Q\)-main eigenvalues
- Equilibrium paths in discounted supergames
- On the \(\alpha\)-index of graphs with pendent paths
- A geometrical characterization of strongly regular graphs
- The spectral radius of trees on \(k\) pendant vertices
- Spectral bounds and distance-regularity
- There is no (75,32,10,16) strongly regular graph
- On graphs with prescribed star complements
- On the index of bicyclic graphs with perfect matchings
- Constructing fullerene graphs from their eigenvalues and angles
- The complement of the path is determined by its spectrum
- On the components of NEPS of connected bipartite graphs
- The changes in indices of modified graphs
- Some results on graph spectra
- The characteristic polynomial of the Laplacian of graphs in (\(a\), \(b\))-linear classes
- Star complements and switching in graphs
- Polynomial reconstruction and terminal vertices
- Graphs with least eigenvalue -2; a historical survey and recent developments in maximal exceptional graphs
- Equitable switching and spectra of graphs
- Extreme eigenfunctions of adjacency matrices for planar graphs employed in spatial analyses
- Which non-regular bipartite integral graphs with maximum degree four do not have 1 as eigenvalues?
- Graph Laplacians, nodal domains, and hyperplane arrangements
- On some algorithmic investigations of star partitions of graphs
- On the least eigenvalue of cacti with pendant vertices
- On maximal entries in the principal eigenvector of graphs
- On diagonal equations over finite fields via walks in NEPS of graphs
- On the spectrum of an equitable quotient matrix and its application
- On some properties of graph irregularity indices with a particular regard to the \(\sigma \)-index
- On sums of graph eigenvalues
- On the expressive power of linear algebra on graphs
- On the spectral radius of block graphs having all their blocks of the same size
- On main eigenvalues of chain graphs
- Equiangular lines in low dimensional Euclidean spaces
- The maximum spectral radius of irregular bipartite graphs
- On minimum algebraic connectivity of graphs whose complements are bicyclic
- Signed graphs whose spectrum is bounded by \(- 2\)
- The many facets of the Estrada indices of graphs and networks
- Maximal graphs with a prescribed complete bipartite graph as a star complement
- The necessity of conditions for graph quantum ergodicity and Cartesian products with an infinite graph
- Network properties of healthy and Alzheimer brains
- Ordering starlike trees by the totality of their spectral moments
- On Quipus whose signless Laplacian index does not exceed 4.5
- On singular signed graphs with nullspace spanned by a full vector: signed nut graphs
- The generalized microscopic image reconstruction problem
- The spectrum of a class of uniform hypergraphs
- Distance spectral radius of trees with given number of segments
- Solutions for two conjectures on the eigenvalues of the eccentricity matrix, and beyond
- The devil is in the details: spectrum and eigenvalue distribution of the discrete Preisach memory model
- Food webs robustness to biodiversity loss: the roles of connectance, expansibility and degree distribution
- Eigenfunctions and minimum 1-perfect bitrades in the Hamming graph
- Extremal spectral radius of graphs with rank 4
- The main vertices of a star set and related graph parameters
- On the largest and least eigenvalues of eccentricity matrix of trees
- Welfare targeting in networks
- Spectra and eigenspaces of arbitrary lifts of graphs
- On the nullity of a connected graph in terms of order and maximum degree
- The effect of a graft transformation on distance spectral radius
- Equilibrium existence and uniqueness in network games with additive preferences
- Regular graphs with a prescribed complete multipartite graph as a star complement
- On the distance signless Laplacian spectrum of graphs
- On the largest eigenvalue of signed unicyclic graphs
- On adjacency-distance spectral radius and spread of graphs
- Slobodan Simić: an appreciation
- Some new aspects of main eigenvalues of graphs
- Extremal problems involving the two largest complementarity eigenvalues of a graph
- The edge-connectivity of strongly 3-walk-regular graphs
This page was built for publication: Eigenspaces of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2785496)