Spektren endlicher Grafen
From MaRDI portal
Publication:768643
DOI10.1007/BF02941924zbMATH Open0077.36704OpenAlexW154962059MaRDI QIDQ768643FDOQ768643
Lothar Collatz, Ulrich Sinogowitz
Publication date: 1957
Published in: Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02941924
Cited In (only showing first 100 items - show all)
- Large regular bipartite graphs with median eigenvalue 1
- The extremal graphs with respect to their nullity
- Proof of a conjecture on the nullity of a graph
- Sharp bounds on the eigenvalues of trees
- Some new lower bounds for energy of graphs
- On the sum of the \(k\) largest eigenvalues of graphs and maximal energy of bipartite graphs
- Title not available (Why is that?)
- Relation between the nullity of a graph and its matching number
- A new upper bound for the spectral radius of graphs with girth at least 5
- Gaussianization of the spectra of graphs and networks. Theory and applications
- An upper bound of the nullity of a graph in terms of order and maximum degree
- Tight bounds on the spectral radius of asymmetric nonnegative matrices
- On minimally 2-(edge)-connected graphs with extremal spectral radius
- The positive and the negative inertia index of line graphs of trees
- On Hamiltonian graphs with maximal index
- Proof of a conjecture on the nullity of a connected graph in terms of order and maximum degree
- Some properties of the Zagreb indices
- The proof on the conjecture of extremal graphs for the \(k\)th eigenvalues of trees
- The inertia of weighted unicyclic graphs
- No graph with nullity \(\eta(G) = | V(G) | - 2 m(G) + 2 c(G) - 1\)
- The leaf-free graphs with nullity \(2 c ( G ) - 1\)
- A sharp upper bound of the nullity of a connected graph in terms of order and maximum degree
- The multiplicity of an arbitrary eigenvalue of a graph in terms of cyclomatic number and number of pendant vertices
- Singular graphs with dihedral group action
- The symbiotic relationship of combinatorics and matrix theory
- GRAPHS DETERMINED BY THEIR -GAIN SPECTRA
- Some further development on the eigensystem approach for graph isomorphism detection
- Graph theoretic models
- Graphs with small independence number minimizing the spectral radius
- On total irregularity index of trees with given number of segments or branching vertices
- A spectral version of Mantel's theorem
- Open problems on graph eigenvalues studied with AutoGraphiX
- Sharp lower bounds on the spectral radius of uniform hypergraphs concerning degrees
- Least eigenvalue of the connected graphs whose complements are cacti
- On the geometry and Laplacian of a graph
- On the characteristic polynomial of the adjacency matrix of the subdivision graph of a graph
- Ordering graphs with small index and its application
- Hermitian adjacency spectrum and switching equivalence of mixed graphs
- A NOTE ON THE SINGULARITY OF ORIENTED GRAPHS
- Conjectures on index and algebraic connectivity of graphs
- Minimal configuration unicyclic graphs
- On characteristic and permanent polynomials of a matrix
- On irreducible endospectral graphs
- The multiplicities of eigenvalues of a graph
- Nullities of graphs with given order, matching number and cyclomatic number revisited
- Some results on the Laplacian eigenvalues of unicyclic graphs
- On the maximal-adjacency-spectrum unicyclic graphs with given maximum degree
- Exploring the “Middle Earth” of network spectra via a Gaussian matrix function
- The characteristic polynomial of a graph
- A graph polynomial and its applications
- Some properties of the distance Laplacian eigenvalues of a graph
- Constructing graphs with given spectrum and the spectral radius at most 2
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the \(A_{\alpha}\)-spectra of trees
- On the spectral radius of minimally 2-(edge)-connected graphs with given size
- An improved lower bound for the nullity of a graph in terms of matching number
- Computing and interpreting the adjacency spectrum of traffic networks
- Computing the characteristic polynomial of a tree
- Lower bounds for the \(\mathcal{A}_\alpha\)-spectral radius of uniform hypergraphs
- On the difference of energies of a graph and its complement graph
- The matching polynomials and spectral radii of uniform supertrees
- Generalizations of Szőkefalvi Nagy and Chebyshev inequalities with applications in spectral graph theory
- Random neighborhood graphs as models of fracture networks on rocks: structural and dynamical analysis
- Signless Laplacian energy of a graph and energy of a line graph
- On some properties of graph irregularity indices with a particular regard to the \(\sigma \)-index
- Centralities of a network and its line graph: an analytical comparison by means of their irregularity
- On the irregularity of uniform hypergraphs
- On the irregularity of uniform hypergraphs
- Constructing non-isomorphic signless Laplacian cospectral graphs
- Spectral Radius of Graphs
- The rank of a signed graph
- Some mixed graphs with \(H\)-rank 4, 6 or 8
- The characteristic polynomial of a graph containing loops
- NONREGULAR GRAPHS WITH MINIMAL TOTAL IRREGULARITY
- Measure-theoretic bounds on the spectral radius of graphs from walks
- The nullity of bicyclic signed graphs
- Digraphs with Hermitian spectral radius below 2 and their cospectrality with paths
- The rank of a complex unit gain graph in terms of the rank of its underlying graph
- Extending the characteristic polynomial for characterization of C\(_{20}\) fullerene congeners
- On the signless Laplacian spectral radius of irregular graphs
- Cospectrality of graphs with respect to distance matrices
- The rank of a signed graph in terms of the rank of its underlying graph
- Complementarity spectrum of digraphs
- On conjectures of network distance measures by using graph spectra
- Kemeny's constant for several families of graphs and real-world networks
- SINGULARITY OF ORIENTED GRAPHS FROM SEVERAL CLASSES
- On the upper bounds for the degree deviation of graphs
- On the N-spectrum of oriented graphs
- On maximum signless Laplacian Estrada index of graphs with given parameters II
- Graphs with maximal \(\sigma\) irregularity
- Coefficients of the characteristic polynomial of the (signless, normalized) Laplacian of a graph
- The first few unicyclic and bicyclic hypergraphs with largest spectral radii
- On the spectral characterization of the \(p\)-sun and the \((p, Q)\)-double sun
- An upper bound for the nullity of a bipartite graph in terms of its maximum degree
- A note on the nullity of unicyclic signed graphs
- Stepwise irregular graphs
- Spectral radius ordering of starlike trees
- Graph irregularity and its measures
- Dynamical systems associated with adjacency matrices
This page was built for publication: Spektren endlicher Grafen
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q768643)