The following pages link to Bounds on graph eigenvalues. I (Q861032):
Displaying 18 items.
- The least eigenvalue of signless Laplacian of non-bipartite graphs with given domination number (Q396729) (← links)
- Graph realizations associated with minimizing the maximum eigenvalue of the Laplacian (Q662288) (← links)
- Domination number and Laplacian eigenvalue distribution (Q901155) (← links)
- A sharp upper bound on algebraic connectivity using domination number (Q967504) (← links)
- A lower bound for the algebraic connectivity of a graph in terms of the domination number (Q1617025) (← links)
- Eigenvalues of subgraphs of the cube (Q1746572) (← links)
- Some spectral properties of the non-backtracking matrix of a graph (Q2020643) (← links)
- The spectral radius and domination number in linear uniform hypergraphs (Q2051910) (← links)
- A bound for the \(p\)-domination number of a graph in terms of its eigenvalue multiplicities (Q2104984) (← links)
- The product of two high-frequency graph Laplacian eigenfunctions is smooth (Q2111909) (← links)
- Vertex-connectivity, chromatic number, domination number, maximum degree and Laplacian eigenvalue distribution (Q2226407) (← links)
- Lower bounds for the Laplacian spectral radius of graphs (Q2238865) (← links)
- Bounds on Laplacian eigenvalues related to total and signed domination of graphs (Q3073474) (← links)
- Domination and Spectral Graph Theory (Q3384115) (← links)
- Signed and Minus Dominating Functions in Graphs (Q3384612) (← links)
- Laplacian and signless Laplacian spectral radii of graphs with fixed domination number (Q4982612) (← links)
- Bounds for the Laplacian spectral radius of graphs (Q5006624) (← links)
- On the spectral radius of graphs with given maximum degree and girth (Q6492426) (← links)
