The following pages link to Spektren endlicher Grafen (Q768643):
Displaying 50 items.
- Characterization of graphs with given order, given size and given matching number that minimize nullity (Q271637) (← links)
- Nullity of a graph in terms of the dimension of cycle space and the number of pendant vertices (Q323069) (← links)
- Characterization of graphs whose signature equals the number of odd cycles (Q331171) (← links)
- Maximizing spectral radii of uniform hypergraphs with few edges (Q339469) (← links)
- A simple arithmetic criterion for graphs being determined by their generalized spectra (Q345094) (← links)
- Inequalities for the number of walks in graphs (Q378237) (← links)
- On the determinant of bipartite graphs (Q389461) (← links)
- Two Laplacians for the distance matrix of a graph (Q389586) (← links)
- Determinants of grids, tori, cylinders and Möbius ladders (Q392635) (← links)
- Matrix power inequalities and the number of walks in graphs (Q403573) (← links)
- On the spectral radius of tricyclic graphs with a maximum matching (Q414685) (← links)
- A characterization of graphs with rank 5 (Q414705) (← links)
- The communicability distance in graphs (Q414715) (← links)
- Spectral properties of complex unit gain graphs (Q417440) (← links)
- Skew-adjacency matrices of graphs (Q417551) (← links)
- On the nullity of the line graph of unicyclic graph with depth one (Q448347) (← links)
- Constructing graphs with given spectrum and the spectral radius at most 2 (Q501283) (← links)
- Probabilistic inequalities for evaluating structural network measures (Q508736) (← links)
- On the \(A_{\alpha}\)-spectra of trees (Q513238) (← links)
- Extremal graph characterization from the bounds of the spectral radius of weighted graphs (Q535422) (← links)
- A characterization of graphs with rank 4 (Q630525) (← links)
- On the nullity of tricyclic graphs (Q630526) (← links)
- On the nullity of a graph with cut-points (Q648933) (← links)
- Conjectures on index and algebraic connectivity of graphs (Q710881) (← links)
- Open problems on graph eigenvalues studied with AutoGraphiX (Q743636) (← links)
- On the maximal-adjacency-spectrum unicyclic graphs with given maximum degree (Q782328) (← links)
- On the power of a perturbation for testing non-isomorphism of graphs (Q797996) (← links)
- Eigenvalues and degree deviation in graphs (Q819785) (← links)
- Relation between the nullity of a graph and its matching number (Q833002) (← links)
- On the nullity and the matching number of unicyclic graphs (Q837008) (← links)
- Walks and the spectral radius of graphs (Q852649) (← links)
- Large matchings from eigenvalues (Q869943) (← links)
- Starlike trees are determined by their Laplacian spectrum (Q875017) (← links)
- Hermitian adjacency spectrum and switching equivalence of mixed graphs (Q891549) (← links)
- Relation between signless Laplacian energy, energy of graph and its line graph (Q905706) (← links)
- Unoriented Laplacian maximizing graphs are degree maximal (Q932145) (← links)
- Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph (Q932184) (← links)
- Ordering graphs with index in the interval \((2, \sqrt{2+\sqrt 5})\) (Q944719) (← links)
- On the nullity of bicyclic graphs (Q947600) (← links)
- On the nullity of graphs with pendent vertices (Q947624) (← links)
- A lower bound for the spectral radius of a digraph (Q972798) (← links)
- The spectral radius of bicyclic graphs with prescribed degree sequences (Q984868) (← links)
- The proof on the conjecture of extremal graphs for the \(k\)th eigenvalues of trees (Q996214) (← links)
- The minimum rank of symmetric matrices described by a graph: a survey (Q996311) (← links)
- Sharp bounds on the eigenvalues of trees (Q1004756) (← links)
- Some results on the Laplacian eigenvalues of unicyclic graphs (Q1014473) (← links)
- On the index of tricyclic graphs with perfect matchings (Q1039740) (← links)
- The spread of the unicyclic graphs (Q1041215) (← links)
- Computing the characteristic polynomial of a tree (Q1057861) (← links)
- Computing and interpreting the adjacency spectrum of traffic networks (Q1073716) (← links)
