The following pages link to (Q3907599):
Displaying 50 items.
- On extremal bipartite unicyclic graphs (Q2442249) (← links)
- A decreasing sequence of upper bounds for the Laplacian energy of a tree (Q2442374) (← links)
- Graphs with the maximal Estrada indices (Q2442375) (← links)
- The signature of line graphs and power trees (Q2442442) (← links)
- The largest matching root of unicyclic graphs (Q2445255) (← links)
- The Laplacian polynomial and Kirchhoff index of graphs derived from regular graphs (Q2446898) (← links)
- Sharp bounds for the spectral radius of nonnegative matrices (Q2447970) (← links)
- A reciprocal eigenvalue property for unicyclic weighted directed graphs with weights from \(\{\pm 1,{\pm}i\}\) (Q2447977) (← links)
- Energy of signed digraphs (Q2449072) (← links)
- An edge-separating theorem on the second smallest normalized Laplacian eigenvalue of a graph and its applications (Q2449111) (← links)
- On the sizes of expander graphs and minimum distances of graph codes (Q2449138) (← links)
- Six classes of trees with largest normalized algebraic connectivity (Q2451679) (← links)
- Bounds on graph eigenvalues. II (Q2459961) (← links)
- Ordering trees with algebraic connectivity and diameter (Q2459973) (← links)
- On a matrix-based measure of the degree of coreness of a node in a network (Q2460495) (← links)
- Unicyclic graphs possessing Kekulé structures with minimal energy (Q2468673) (← links)
- Energies of some non-regular graphs (Q2468682) (← links)
- The ordering of trees and connected graphs by algebraic connectivity (Q2477524) (← links)
- Cut-off for large sums of graphs (Q2477558) (← links)
- A sharp upper bound for the number of spanning trees of a graph (Q2478168) (← links)
- Constructing pairs of equienergetic and non-cospectral graphs (Q2483138) (← links)
- Graph \(Z_{n}\) and some graphs related to \(Z_{n}\) are determined by their spectrum (Q2484386) (← links)
- Spectra and energies of iterated line graphs of regular graphs (Q2484670) (← links)
- Variation of the Wiener index under tree transformations (Q2486747) (← links)
- Stability of conjugated carbon nanocones (Q2503700) (← links)
- Unicyclic Hückel molecular graphs with minimal energy (Q2503726) (← links)
- Connections between Wiener index and matchings (Q2503738) (← links)
- Some results on symmetric double starlike trees (Q2504089) (← links)
- A note on the number of spanning trees of line digraphs (Q2514153) (← links)
- Integral trees with diameters 5 and 6 (Q2566149) (← links)
- The spectral radius of unicyclic and bicyclic graphs with \(n\) vertices and \(k\) pendant vertices (Q2568361) (← links)
- On the nullity of unicyclic graphs (Q2568370) (← links)
- Comparing momenta and \(\pi\)-electron energy of benzenoid molecules (Q2575788) (← links)
- Trace-minimal graphs and D-optimal weighing designs (Q2576216) (← links)
- Spatial design matrices and associated quadratic forms: structure and properties (Q2581508) (← links)
- Graphs with maximum Laplacian and signless Laplacian Estrada index (Q2629276) (← links)
- On the relationship between the multiplicities of the matrix spectrum and the signs of the components of its eigenvectors in a tree-like structure (Q2632545) (← links)
- A complete characterization of the discrete \(p\)-Laplacian parabolic equations with \(q\)-nonlocal reaction with respect to the blow-up property (Q2633364) (← links)
- MMS-type problems for Johnson scheme (Q2633492) (← links)
- On extremal bipartite bicyclic graphs (Q2634185) (← links)
- An infinite family of graphs with a facile count of perfect matchings (Q2636812) (← links)
- Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank (Q2636822) (← links)
- Extremal digraphs with given clique number (Q2637154) (← links)
- Designs associated with maximum independent sets of a graph (Q2638418) (← links)
- Laplacian spectral bounds for clique and independence numbers of graphs (Q2642010) (← links)
- Cliques and the spectral radius (Q2642018) (← links)
- The fundamental group and Galois coverings of hexagonal systems in 3-space (Q2644150) (← links)
- Measuring similarity between connected graphs: the role of induced subgraphs and complementarity eigenvalues (Q2657102) (← links)
- Complete subgraphs in connected graphs and its application to spectral moment (Q2659058) (← links)
- A sharp lower bound of the spectral radius with application to the energy of a graph (Q2659164) (← links)