Eigenspaces of graphs
From MaRDI portal
algorithmsspectral graph theorycomplexityspectrumstrongly regular graphsperfect matchingPetersen graphspectral invariantsanglesmaximal indexstar partitioncospectral treesmain partstar bases
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02)
Recommendations
Cited in
(only showing first 100 items - show all)- On the expressive power of linear algebra on graphs
- On eigensharp and almost eigensharp graphs
- Theorems on partitioned matrices revisited and their applications to graph spectra
- Graphs with a common eigenvalue deck
- Tree decomposition by eigenvectors
- On adjacency-distance spectral radius and spread of graphs
- Signed graphs with extremal least Laplacian eigenvalue
- Constructing pairs of equienergetic and non-cospectral graphs
- On the spectrum of an equitable quotient matrix and its application
- The changes in indices of modified graphs
- Co-eigenvector graphs
- On split graphs with four distinct eigenvalues
- Which non-regular bipartite integral graphs with maximum degree four do not have 1 as eigenvalues?
- On the least eigenvalue of cacti with pendant vertices
- Path Laplacian matrices: introduction and application to the analysis of consensus in networks
- On least eigenvalues of bicyclic graphs with fixed number of pendant vertices
- Balanced centrality of networks
- The transfer matrices and the capacity of the 2-dimensional (1, )-runlength limited constraint
- On the expressive power of linear algebra on graphs
- Spectra of large random trees
- Calculating elements of matrix functions using divided differences
- On the power of combinatorial and spectral invariants
- scientific article; zbMATH DE number 1539536 (Why is no real title available?)
- Controllability of undirected graphs
- The spread of the spectrum of a graph
- Unoriented Laplacian maximizing graphs are degree maximal
- Asymptotic results regarding the number of walks in a graph
- The spectral radius of edge chromatic critical graphs
- Semiregular trees with minimal Laplacian spectral radius
- Eigen-persistence in graphs
- Projection approaches to process mining using region-based techniques
- Minimum supports of functions on the Hamming graphs with spectral constraints
- Weighted microscopic image reconstruction
- Computing the reciprocal distance signless Laplacian eigenvalues and energy of graphs
- The number of walks in a graph
- Signed graphs whose spectrum is bounded by \(- 2\)
- An edge-rotating theorem on the least eigenvalue of graphs
- Matrix functions in network analysis
- Applications of Estrada indices and energy to a family of compound graphs
- The Laplacian spectral radius of a graph under perturbation
- A gradient-type algorithm optimizing the coupling between matrices
- 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
- Network robustness to targeted attacks. The interplay of expansibility and degree distribution
- Vertex and edge orbits in nut graphs
- Cospectral graphs and the generalized adjacency matrix
- Extremal octagonal chains with respect to the spectral radius
- The cost of segregation in (social) networks
- On the limiting behavior of parameter-dependent network centrality measures
- On the spectrum of Cayley graphs related to the finite groups
- Spectral ordering of trees with small index
- scientific article; zbMATH DE number 5901910 (Why is no real title available?)
- Drawing graphs by eigenvectors: theory and practice
- Biregular graphs with three eigenvalues
- A formalism for evaluating analytically the cross-correlation structure of a firing-rate network model
- Axioms for centrality scoring with principal eigenvectors
- Connected graphs with maximal \(Q\)-index: The one-dominating-vertex case
- On perturbations of almost distance-regular graphs
- The spread of unicyclic graphs with given size of maximum matchings
- Extreme eigenfunctions of adjacency matrices for planar graphs employed in spatial analyses
- A note on Hoffman-type identities of graphs
- Further results on the least eigenvalue of connected graphs
- scientific article; zbMATH DE number 2149405 (Why is no real title available?)
- Ordering trees by their largest eigenvalues
- On dynamic network security: a random decentering algorithm on graphs
- A class of highly symmetric graphs, symmetric cylindrical constructions and their spectra
- Some new aspects of main eigenvalues of graphs
- Ordering graphs with index in the interval \((2, \sqrt{2+\sqrt 5})\)
- On the \(\alpha\)-index of graphs with pendent paths
- Finding singularly cospectral graphs
- On some properties of graph irregularity indices with a particular regard to the \(\sigma \)-index
- On the isoperimetric spectrum of graphs and its approximations
- On graphs with exactly three \(Q\)-main eigenvalues
- The efficiency and stability of R\&D networks
- A characterization of skew Hadamard matrices and doubly regular tournaments
- Isospectral polygons, planar graphs and heat content
- Controllability of NEPSes of graphs
- Connected graphs of fixed order and size with maximal index: some spectral bounds
- The main vertices of a star set and related graph parameters
- Eigenfunctions and minimum 1-perfect bitrades in the Hamming graph
- On nested split graphs whose second largest eigenvalue is less than 1
- Graph homomorphisms and nodal domains
- scientific article; zbMATH DE number 32145 (Why is no real title available?)
- Some regular signed graphs with only two distinct eigenvalues
- The maximal exceptional graphs
- Families of nested graphs with compatible symmetric-group actions
- The anti-adjacency matrix of a graph: eccentricity matrix
- Vertex-removal, vertex-addition and different notions of similarity for vertices of a graph
- Some results on the index of unicyclic graphs
- The spectra of some families of digraphs
- On the largest eigenvalue of signed unicyclic graphs
- Graph spectra in computer science
- On the combinatorics of smoothing
- Signed line graphs with least eigenvalue -2: the star complement technique
- Graphs for which the least eigenvalue is minimal. I
- 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
- Matchings in regular graphs from eigenvalues
- On sums of graph eigenvalues
- On the spectral radius of unicyclic graphs with prescribed degree sequence
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)