Pages that link to "Item:Q896859"

The following pages link to Maximizing the spectral radius of \(k\)-connected graphs with given diameter (Q896859):

Displaying 7 items.

• Connectivity, diameter, minimal degree, independence number and the eccentric distance sum of graphs (Q1671325) (← links)
• Some results on the distance and distance signless Laplacian spectral radius of graphs and digraphs (Q1737154) (← links)
• Maximizing the \(A_\alpha \)-spectral radius of graphs with given size and diameter (Q2158278) (← links)
• On the (signless Laplacian) spectral radius of minimally \(k\)-(edge)-connected graphs for small \(k\) (Q2235269) (← links)
• Connectivity, diameter, independence number and the distance spectral radius of graphs (Q2361551) (← links)
• On spectral radius of graphs with pendant paths (Q2419006) (← links)
• Maximizing the signless Laplacian spectral radius of \(k\)-connected graphs with given diameter (Q2656640) (← links)