The following pages link to (Q3907599):
Displaying 50 items.
- On the spectra of certain graphs arising from finite fields (Q1273216) (← links)
- The algebra of flows in graphs (Q1276390) (← links)
- On the distribution of eigenvalues of graphs (Q1297457) (← links)
- Factoring distance matrix polynomials (Q1313852) (← links)
- Bounds of eigenvalues of graphs (Q1313968) (← links)
- \(\ell_ 1\)-rigid graphs (Q1321589) (← links)
- Sharp bound of the \(k\)th eigenvalue of trees (Q1322172) (← links)
- On the coefficients of the characteristic polynomial of a matrix (Q1322277) (← links)
- Heat conduction on graphs (Q1329793) (← links)
- Fractional isomorphism of graphs (Q1336666) (← links)
- A computational study of graph partitioning (Q1340061) (← links)
- On the channel capacity of read/write isolated memory (Q1343149) (← links)
- Algebraic graph theory without orientation (Q1344067) (← links)
- Bounds on the largest eigenvalues of trees with a given size of matching (Q1347942) (← links)
- Eigenvalues, eigenspaces and distances to subsets (Q1356741) (← links)
- Aztec diamonds, checkerboard graphs, and spanning trees (Q1361460) (← links)
- Partitioned tensor products and their spectra (Q1361461) (← links)
- Elliptic matrices and their eigenpolynomials (Q1362648) (← links)
- From local adjacency polynomials to locally pseudo-distance-regular graphs (Q1366602) (← links)
- A new upper bound for the isoperimetric number of de Bruijn networks (Q1375854) (← links)
- Bounds on eigenvalues and chromatic numbers (Q1377497) (← links)
- On the characteristic polynomial of homeomorphic images of a graph (Q1377786) (← links)
- On cages for girth pair \((6,b)\) (Q1377882) (← links)
- The local density of triangle-free graphs (Q1382812) (← links)
- The complexity of the characteristic and the minimal polynomial. (Q1401240) (← links)
- On Cheeger inequalities of a graph (Q1402090) (← links)
- On the spectral radius of unicyclic graphs with perfect matchings (Q1405041) (← links)
- D'Alembert formula on finite one-dimensional networks. (Q1406974) (← links)
- Polygonal chains with minimal energy (Q1410727) (← links)
- On graphs with algebraic connectivity equal to minimum edge density (Q1414127) (← links)
- \(D\)-optimal weighing designs for \(n\equiv -1\pmod 4\) objects and a large number of weighings (Q1414159) (← links)
- Computing the average parallelism in trace monoids. (Q1417573) (← links)
- On unicyclic graphs whose second largest eigenvalue does not exceed 1 (Q1421489) (← links)
- Upper and lower bounds for the energy of bipartite graphs. (Q1425126) (← links)
- \(N\) identical particles under quantum confinement: a many-body dimensional perturbation theory approach. (Q1426406) (← links)
- Families of integral trees with diameters 4, 6, and 8. (Q1427190) (← links)
- Bipartite graphs with small third Laplacian eigenvalue. (Q1427483) (← links)
- A note on the second largest eigenvalue of a tree with perfect matchings. (Q1428614) (← links)
- Homogeneous multivariate polynomials with the half-plane property (Q1432999) (← links)
- Semiharmonic trees and monocyclic graphs (Q1433219) (← links)
- On the spectral radius of graphs (Q1434383) (← links)
- Upper bounds of the spectral radius of graphs in terms of genus (Q1569038) (← links)
- Graphs with the same determinant as a complete graph (Q1573672) (← links)
- The number of nets of the regular convex polytopes in dimension \(\leq 4\) (Q1584269) (← links)
- On the dual distance and the gap of a binary code (Q1584453) (← links)
- The cycle-path indicator polynomial of a digraph (Q1585495) (← links)
- On the third largest eigenvalue of a graph (Q1587896) (← links)
- Spectral determinant on quantum graphs (Q1588733) (← links)
- Maximal graphs and graphs with maximal spectral radius (Q1602993) (← links)
- Extremal hexagonal chains concerning largest eigenvalue (Q1609706) (← links)
