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)
- 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
- Enumeration of cubic Cayley graphs on dihedral groups
- On the Characteristic Equations of the Characteristic Polynomial
- The \(\alpha\)-spectral radius of uniform hypergraphs concerning degrees and domination number
- Cospectral graphs, GM-switching and regular rational orthogonal matrices of level \(p\)
- Aα-spectral radius and measures of graph irregularity
- Conjugate Laplacian matrices of a graph
- The many facets of the Estrada indices of graphs and networks
- Lower bounds for the spectral norm of digraphs
- On irregularity indices and main eigenvalues of graphs and their applicability
- Bounds on the spectral radii of digraphs in terms of walks
- The spread of the spectrum of a graph
- The communicability distance in graphs
- The signature of line graphs and power trees
- The irregularity of graphs under graph operations
- Unoriented Laplacian maximizing graphs are degree maximal
- Maximizing spectral radii of uniform hypergraphs with few edges
- Two Laplacians for the distance matrix of a graph
- On parallelization of the loop over elements in FEAP
- Skew-adjacency matrices of graphs
- On the spectral characterizations of graphs
- Characterization of graphs with given order, given size and given matching number that minimize nullity
- Spektren periodischer Graphen
- A characterization of graphs with rank 5
- On the spectral radius of tricyclic graphs with a maximum matching
- On the nullity of the line graph of unicyclic graph with depth one
- Determinants of grids, tori, cylinders and Möbius ladders
- A note on the irregularity of graphs
- Large matchings from eigenvalues
- A note on cospectral graphs
- A characterization of graphs with rank 4
- On the nullity of tricyclic graphs
- On the nullity of a graph with cut-points
- Ordering graphs with index in the interval \((2, \sqrt{2+\sqrt 5})\)
- Line graphs, root systems, and elliptic geometry
- Spectral properties of complex unit gain graphs
- On the nullity of bipartite graphs
- The nullity ofk-cyclic graphs of ∞-type
- Entropy and the complexity of graphs: III. Graphs with prescribed information content
- On the nullity and the matching number of unicyclic graphs
- Extremal graph characterization from the bounds of the spectral radius of weighted graphs
- On the distance matrix of a tree
- Which graphs are determined by their spectrum?
- Distance matrix polynomials of trees
- Relation between signless Laplacian energy, energy of graph and its line graph
- On the nullity of bicyclic graphs
- On the construction of graphs of nullity one
- On the maximal index of connected graphs
- Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph
- Characterization of digraphs with three complementarity eigenvalues
- Probabilistic inequalities for evaluating structural network measures
- The largest eigenvalue of a graph: A survey
- Signless Laplacian spectrum of a class of generalized corona and its application
- On the power of a perturbation for testing non-isomorphism of graphs
- Nullity of a graph in terms of path cover number
- On the nullity number of graphs
- Matrix power inequalities and the number of walks in graphs
- Some new bounds on the spectral radius of graphs
- On the index of bicyclic graphs with perfect matchings
- A lower bound for the spectral radius of a digraph
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)