The following pages link to (Q4327350):
Displaying 50 items.
- Degree-equipartite graphs (Q534061) (← links)
- On edge star sets in trees (Q539870) (← links)
- The signless Laplacian spectral radius of tricyclic graphs and trees with \(k\) pendant vertices (Q541946) (← links)
- Bounds for the signless Laplacian energy (Q550610) (← links)
- On eigenvalue multiplicity and the girth of a graph (Q550611) (← links)
- Proof of conjecture involving the second largest signless Laplacian eigenvalue and the index of graphs (Q550616) (← links)
- Effective graph resistance (Q550630) (← links)
- Universal adjacency matrices with two eigenvalues (Q550632) (← links)
- Graphs whose normalized Laplacian has three eigenvalues (Q550639) (← links)
- A note on the signless Laplacian eigenvalues of graphs (Q550641) (← links)
- New upper bounds for estrada index of bipartite graphs (Q550644) (← links)
- Spectra of coronae (Q551245) (← links)
- Ordering of trees with fixed matching number by the Laplacian coefficients (Q551269) (← links)
- The least eigenvalue of the complements of trees (Q551342) (← links)
- On the maximal energy tree with two maximum degree vertices (Q551355) (← links)
- On the largest eigenvalues of trees with perfect matchings (Q551881) (← links)
- On Harary index (Q551958) (← links)
- Complete synchronization on multi-layer center dynamical networks (Q602613) (← links)
- Spectral radius of finite and infinite planar graphs and of graphs of bounded genus (Q602728) (← links)
- Distance spectral radius of trees with given matching number (Q602758) (← links)
- Spectral determination of graphs whose components are paths and cycles (Q604009) (← links)
- On the index of necklaces (Q604670) (← links)
- Graphs for small multiprocessor interconnection networks (Q606803) (← links)
- A note on Laplacian eigenmaps (Q615259) (← links)
- Theorems on partitioned matrices revisited and their applications to graph spectra (Q616294) (← links)
- Bounds on the estrada index of ISR (4,6)-fullerenes (Q619837) (← links)
- Graph spectra in computer science (Q627958) (← links)
- Bounds on the eigenvalues of graphs with cut vertices or edges (Q630554) (← links)
- On tricyclic graphs whose second largest eigenvalue does not exceed 1 (Q632473) (← links)
- Distance spectral radius of graphs with \(r\) pendent vertices (Q636242) (← links)
- Graphs whose signless Laplacian spectral radius does not exceed the Hoffman limit value (Q636251) (← links)
- On the signless Laplacian index of unicyclic graphs with fixed diameter (Q648944) (← links)
- On the roots of edge cover polynomials of graphs (Q648996) (← links)
- On the Laplacian spread of graphs (Q654257) (← links)
- Graph realizations associated with minimizing the maximum eigenvalue of the Laplacian (Q662288) (← links)
- Balance in gain graphs - a spectral analysis (Q665934) (← links)
- On the distance spectral radius of bipartite graphs (Q665951) (← links)
- Spectral distances of graphs (Q665961) (← links)
- Asymptotically optimal dynamic tree evolution by rapidly mixing random walks on regular networks (Q666208) (← links)
- Binary representations of regular graphs (Q666512) (← links)
- On the adjacency, Laplacian, and signless Laplacian spectrum of coalescence of complete graphs (Q670591) (← links)
- A unified approach to the asymptotic topological indices of various lattices (Q670763) (← links)
- Integral trees with diameter four (Q671195) (← links)
- On least eigenvalues of bicyclic graphs with fixed number of pendant vertices (Q690534) (← links)
- Approximating the maximum size of a \(k\)-regular induced subgraph by an upper bound on the co-\(k\)-plex number (Q690542) (← links)
- On hereditary properties of the class of graphs with convex quadratic stability number (Q690543) (← links)
- The number of spanning trees in some classes of graphs (Q691272) (← links)
- Gambler's ruin problem in several dimensions (Q696849) (← links)
- On the two largest \(Q\)-eigenvalues of graphs (Q710585) (← links)
- Combinatorial approach for computing the characteristic polynomial of a matrix (Q710864) (← links)
