Spektren endlicher Grafen
From MaRDI portal
Publication:768643
Cited in
(only showing first 100 items - show all)- Lower bounds for the spectral norm of digraphs
- Lower bounds for the \(\mathcal{A}_\alpha\)-spectral radius of uniform hypergraphs
- Combinatorial inversion in edge-weighted unicyclic graphs
- On irregularity indices and main eigenvalues of graphs and their applicability
- The extremal graphs with respect to their nullity
- Bounds on the spectral radii of digraphs in terms of walks
- The communicability distance in graphs
- Sharp bounds on the eigenvalues of trees
- On the difference of energies of a graph and its complement graph
- Some new lower bounds for energy of graphs
- On maximum signless Laplacian Estrada index of graphs with given parameters. II
- The signature of line graphs and power trees
- Relation between the nullity of a graph and its matching number
- The irregularity of graphs under graph operations
- Bounds for the rank of a complex unit gain graph in terms of its maximum degree
- On the sum of the \(k\) largest eigenvalues of graphs and maximal energy of bipartite graphs
- Maximizing spectral radii of uniform hypergraphs with few edges
- Proof of a conjecture on the nullity of a graph
- The spread of the spectrum of a graph
- Unoriented Laplacian maximizing graphs are degree maximal
- Characterization of sub-long graphs of arbitrary rank
- The matching polynomials and spectral radii of uniform supertrees
- Covering energy of posets and its bounds
- A note on the singularity of oriented graphs
- Two Laplacians for the distance matrix of a graph
- Spectral multiplicity functions of adjacency operators of graphs and cospectral infinite graphs
- Coalescing Fiedler and core vertices.
- A note on the Nordhaus-Gaddum type inequality to the second largest eigenvalue of a graph
- Skew-adjacency matrices of graphs
- Eigen-persistence in graphs
- Generalizations of Szőkefalvi Nagy and Chebyshev inequalities with applications in spectral graph theory
- On parallelization of the loop over elements in FEAP
- Some properties of the distance Laplacian eigenvalues of a graph.
- On second Zagreb energy of graphs
- Graphs with nullity \(2c(G)+p(G)-1\)
- On the spectral characterizations of graphs
- A new upper bound for the spectral radius of graphs with girth at least 5
- Characterization of graphs with given order, given size and given matching number that minimize nullity
- NP-hardness and inapproximability of sparse PCA
- A note on the relationship between graph energy and determinant of adjacency matrix
- Spektren periodischer Graphen
- Conjugate Laplacian eigenvalues of co-neighbour graphs
- Random neighborhood graphs as models of fracture networks on rocks: structural and dynamical analysis
- 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
- Gaussianization of the spectra of graphs and networks. Theory and applications
- A note on the irregularity of graphs
- An upper bound of the nullity of a graph in terms of order and maximum degree
- Spectral ordering of trees with small index
- Null decomposition of bipartite graphs without cycles of length 0 modulo 4
- On cardinality of complementarity spectra of connected graphs
- Characterization of the minimizing graph of the connected graphs whose complements are bicyclic
- Adjacency rank and independence number of a signed graph
- Large matchings from eigenvalues
- Tight bounds on the spectral radius of asymmetric nonnegative matrices
- A characterization of graphs with rank 4
- On the nullity of tricyclic graphs
- Signless Laplacian energy of a graph and energy of a line graph
- A note on cospectral graphs
- On the nullity of a graph with cut-points
- Ordering graphs with index in the interval \((2, \sqrt{2+\sqrt 5})\)
- On the spectral radius, energy and Estrada index of the Sombor matrix of graphs
- On some properties of graph irregularity indices with a particular regard to the \(\sigma \)-index
- Line graphs, root systems, and elliptic geometry
- Spectral properties of complex unit gain graphs
- Nullity and singularity of a graph in which every block is a cycle
- On minimally 2-(edge)-connected graphs with extremal spectral radius
- The positive and the negative inertia index of line graphs of trees
- Nonsingular (vertex-weighted) block graphs
- Extremal graph characterization from the bounds of the spectral radius of weighted graphs
- On the nullity and the matching number of unicyclic graphs
- On relations between Kirchhoff index, Laplacian energy, Laplacian-energy-like invariant and degree deviation of graphs
- Vertex-removal, vertex-addition and different notions of similarity for vertices of a graph
- On the distance matrix of a tree
- On the nullity of bipartite graphs
- Distance matrix polynomials of trees
- On Hamiltonian graphs with maximal index
- Which graphs are determined by their spectrum?
- Relation between signless Laplacian energy, energy of graph and its line graph
- Entropy and the complexity of graphs: III. Graphs with prescribed information content
- On the nullity of bicyclic graphs
- Singularity of cycle-spliced signed graphs
- On the irregularity of uniform hypergraphs
- On the nullity of a family of tripartite graphs
- Centralities of a network and its line graph: an analytical comparison by means of their irregularity
- Constructing non-isomorphic signless Laplacian cospectral graphs
- Proof of a conjecture on the nullity of a connected graph in terms of order and maximum degree
- On the irregularity of uniform hypergraphs
- On the construction of graphs of nullity one
- On the maximal index of connected graphs
- The proof on the conjecture of extremal graphs for the \(k\)th eigenvalues of trees
- Singularity of oriented graphs from several classes
- The rank of a signed graph
- The inertia of weighted unicyclic graphs
- Constructing cospectral graphs via a new form of graph product
- Some mixed graphs with \(H\)-rank 4, 6 or 8
- No graph with nullity \(\eta(G) = | V(G) | - 2 m(G) + 2 c(G) - 1\)
- Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph
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)