The following pages link to (Q3907599):
Displaying 50 items.
- Rectifying a misbelief: Frank Harary's role in the discovery of the coefficient-theorem in chemical graph theory (Q1817017) (← links)
- Divisors and the spectrum of infinite graphs (Q1820794) (← links)
- Integral complete \(r\)-partite graphs (Q1827791) (← links)
- On graphs whose second largest eigenvalue does not exceed \((\sqrt {5}-1)/2\) (Q1842163) (← links)
- L-polytopes and equiangular lines (Q1842651) (← links)
- Properties of spectra of graphs and line graphs (Q1847637) (← links)
- A sharp upper bound of the spectral radius of graphs (Q1850520) (← links)
- Unicyclic graphs with maximal energy (Q1855384) (← links)
- Forest matrices around the Laplacian matrix (Q1855402) (← links)
- Harmonic trees (Q1861839) (← links)
- Spectral radius of non-negative matrices and digraphs (Q1862883) (← links)
- On the Laplacian spectrum of (\(\alpha,\omega\))-graphs (Q1864581) (← links)
- Characteristic polynomial of catacondensed systems (Q1873711) (← links)
- On the largest eigenvalues of trees (Q1877649) (← links)
- Sparse topologies with small spectrum size (Q1885049) (← links)
- Graph Laplacians, nodal domains, and hyperplane arrangements (Q1886532) (← links)
- A note on almost regular matrices (Q1899400) (← links)
- Star partitions and regularity in graphs (Q1899409) (← links)
- Hamilton cycles and eigenvalues of graphs (Q1899443) (← links)
- On some algorithmic investigations of star partitions of graphs (Q1900141) (← links)
- Random walks and orthogonal functions associated with highly symmetric graphs (Q1901043) (← links)
- Multiplicity of integer roots of polynomials of graphs (Q1902110) (← links)
- The characteristic polynomial of ladder digraph and an annihilating uniqueness theorem (Q1916390) (← links)
- Some methods for counting the spanning trees in labelled molecular graphs, examined in relation to certain fullerenes (Q1917322) (← links)
- The characteristic polynomials of modified graphs (Q1917341) (← links)
- Graph transformations which preserve the multiplicity of an eigenvalue (Q1917342) (← links)
- A complete solution of Hosoya's mystery (Q1920023) (← links)
- On the minimum Perron value for an irreducible tournament matrix (Q1923219) (← links)
- Graphs which have \(n/2\)-minimal line-distinguishing colourings (Q1923477) (← links)
- The smallest values of algebraic connectivity for trees (Q1928128) (← links)
- The critical group of a line graph (Q1928576) (← links)
- Ordering of Hosoya indices for unicyclic Hückel graphs (Q1931011) (← links)
- A characterization of long graphs of arbitrary rank (Q1931744) (← links)
- Positive and negative inertia index of a graph (Q1932609) (← links)
- On least eigenvalues and least eigenvectors of real symmetric matrices and graphs (Q1938694) (← links)
- Radial eigenvectors of the Laplacian of the nonbinary hypercube (Q1938711) (← links)
- The nullity of \((k-1)\)-cyclic graphs (Q1940108) (← links)
- Graphs with few distinct \(D\)-eigenvalues determined by their \(D\)-spectra (Q1979380) (← links)
- Bounds for the skew Laplacian energy of weighted digraphs (Q1984175) (← links)
- Bicyclic signed graphs with minimal and second minimal energy (Q2002806) (← links)
- The coefficients of the immanantal polynomial (Q2007498) (← links)
- On the spectral radius and energy of the weighted adjacency matrix of a graph (Q2007661) (← links)
- Vertex-connectivity and eigenvalues of graphs with fixed girth (Q2008368) (← links)
- On some graphs which satisfy reciprocal eigenvalue properties (Q2013200) (← links)
- A graph spectrum based geometric biclustering algorithm (Q2013269) (← links)
- A formula for all minors of the adjacency matrix and an application (Q2017199) (← links)
- Graphs with few distinct eigenvalues and extremal energy (Q2020686) (← links)
- The \(Q\)-generating function for graphs with application (Q2021601) (← links)
- Fixed-size determinantal point processes sampling for species phylogeny (Q2022318) (← links)
- Asymptotic spectra of large (grid) graphs with a uniform local structure. I: Theory (Q2027286) (← links)
