scientific article; zbMATH DE number 3377258
From MaRDI portal
zbMath0238.05102MaRDI QIDQ5648382
Publication date: 1971
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
On the spectrum of finite Cayley graphs, Spectrum of Gallai graph of some graphs, Ordering starlike trees by the totality of their spectral moments, Interlacing eigenvalues and graphs, Strongly regular graphs with strongly regular decomposition, 5-chromatic strongly regular graphs, Spectral Radius of Graphs, Embedding of sign-regular signed graphs and its spectral analysis, On conjugate adjacency matrices of a graph, Graph partitioning by eigenvectors, Laplacian spectra and spanning trees of threshold graphs, Some methods for counting the spanning trees in labelled molecular graphs, examined in relation to certain fullerenes, Inequalities for the number of walks in graphs, Constructing cospectral graphs via a new form of graph product, Two Laplacians for the distance matrix of a graph, Characterizing threshold graphs with \(k\) main signless Laplacian eigenvalues, Spectral characterization of graphs whose second largest eigenvalue is less than 1, The optimal bound on the 3-independence number obtainable from a polynomial-type method, There is no going back: properties of the non-backtracking Laplacian, Technical Note—Revenue Volatility Under Uncertain Network Effects, A new class of polynomials from the spectrum of a graph, and its application to bound the \(k\)-independence number, A characterization of skew Hadamard matrices and doubly regular tournaments, NEPS of complex unit gain graphs, Which graphs are determined by their spectrum?, Permanental polynomials of graphs, On inertia and ratio type bounds for the \(k\)-independence number of a graph and their relationship, Complete multipartite graphs that are determined, up to switching, by their Seidel spectrum, Characterization and comparison of large directed networks through the spectra of the magnetic Laplacian, Enumeration of cospectral graphs., A surprising property of the least eigenvalue of a graph, Coloring the normalized Laplacian for oriented hypergraphs, On the main spectrum of generalized Bethe trees, Unicyclic and bicyclic graphs with exactly three \(Q\)-main eigenvalues, Spectrum of anti-Gallai graph of some graphs, Minimal Euclidean representations of graphs, Distance regularity of compositions of graphs., On products and line graphs of signed graphs, their eigenvalues and energy, Spectral characterization of some graphs, Spectral upper bounds for the order of a \(k\)-regular induced subgraph, Comparison of graphs by their number of spanning trees, Unnamed Item, Cospectrality of graphs with respect to distance matrices, The \(k\)-regular induced subgraph problem, Nonisomorphic trees with the same T-polynomial, On the spectrum of an extremal graph with four eigenvalues, On the expressive power of linear algebra on graphs, Distance matrix polynomials of trees, On graphs with exactly three Q-main eigenvalues, Spectral conditions for the reconstructibility of a graph, NEPS operations on cordial graphs, Turán's theorem implies Stanley's bound, Some new aspects of main eigenvalues of graphs, Number of walks and degree powers in a graph, Optimization of eigenvalue bounds for the independence and chromatic number of graph powers, When can the components of NEPS of connected bipartite graphs be almost cospectral?, On the \(k\)-independence number of graphs, On symmetric and Hermitian rank distance codes, On the nullity number of graphs, Dual Hoffman Bounds for the Stability and Chromatic Numbers Based on Semidefinite Programming, Some results on graph spectra, Graphs with least eigenvalue \(-2\); a historical survey and recent developments in maximal exceptional graphs, A new eigenvalue bound for independent sets, Aα and Lα-spectral properties of spider graphs, On the spectrum of Cayley graphs related to the finite groups
