Pages that link to "Item:Q1855381"

The following pages link to Sharp upper bounds for the Laplacian graph eigenvalues (Q1855381):

Displaying 32 items.

• The spectral characterization of wind-wheel graphs (Q308318) (← links)
• Sharp upper bounds on the signless Laplacian spectral radius of strongly connected digraphs (Q339488) (← links)
• On the bounds for the largest Laplacian eigenvalues of weighted graphs (Q448971) (← links)
• Upper and lower bounds for the \(q\)-entropy of network models with application to network model selection (Q503599) (← links)
• Which \(Q\)-cospectral graphs have same degree sequences (Q513237) (← links)
• On the Laplacian spectral radii of Halin graphs (Q522534) (← links)
• The Laplacian spectral radii of unicyclic and bicyclic graphs with \(n\) vertices and \(k\) pendant vertices (Q625799) (← links)
• The minimum signless Laplacian spectral radius of graphs with given independence number (Q710876) (← links)
• Some results on the Laplacian spectrum (Q710973) (← links)
• Bounds on graph eigenvalues. I (Q861032) (← links)
• Minimizing the Laplacian eigenvalues for trees with given domination number (Q865427) (← links)
• Network synchronizability analysis: the theory of subgraphs and complementary graphs (Q927896) (← links)
• Ordering trees with \(n\) vertices and matching number \(q\) by their largest Laplacian eigenvalues (Q942089) (← links)
• On upper bounds for Laplacian graph eigenvalues (Q967494) (← links)
• On conjectures involving second largest signless Laplacian eigenvalue of graphs (Q967519) (← links)
• The Laplacian spectral radius of bicyclic graphs with a given girth (Q980358) (← links)
• The Laplacian spectral radius for unicyclic graphs with given independence number (Q984859) (← links)
• The signless Laplacian spread (Q1044539) (← links)
• A characterization on graphs which achieve the upper bound for the largest Laplacian eigenvalue of graphs. (Q1415294) (← links)
• Maximizing the sum of the squares of the degrees of a graph (Q1877650) (← links)
• Primal-dual method for optimization problems with changing constraints (Q2104289) (← links)
• Extremal graph characterization from the upper bound of the Laplacian spectral radius of weighted graphs (Q2383016) (← links)
• Several sharp upper bounds for the largest Laplacian eigenvalue of a graph (Q2475324) (← links)
• A relationship between bounds on the sum of squares of degrees of a graph (Q2504092) (← links)
• A sharp upper bound on the largest Laplacian eigenvalue of weighted graphs (Q2568992) (← links)
• The (signless) Laplacian spectral radii of<i>c</i>-cyclic graphs with<i>n</i>vertices, girth<i>g</i>and<i>k</i>pendant vertices (Q2979467) (← links)
• The (signless) Laplacian spectral radius of unicyclic and bicyclic graphs with n vertices and k pendant vertices (Q3073514) (← links)
• An edge-grafting theorem on Laplacian spectra of graphs and its application (Q3082872) (← links)
• Minimizing the Laplacian spectral radius of trees with given matching number (Q3422771) (← links)
• Some graphs determined by their (signless) Laplacian spectra (Q4909753) (← links)
• Bounds for the Laplacian spectral radius of graphs (Q5006624) (← links)
• The most exigent eigenvalue: guaranteeing consensus under an unknown communication topology and time delays (Q6173487) (← links)