Pages that link to "Item:Q5134961"

The following pages link to Edge connectivity, packing spanning trees, and eigenvalues of graphs (Q5134961):

Displaying 7 items.

• Spectral conditions for edge connectivity and packing spanning trees in multigraphs (Q905705) (← links)
• A matroid approach to finding edge connectivity and packing arborescences (Q1892220) (← links)
• On the (signless Laplacian) spectral radius of minimally \(k\)-(edge)-connected graphs for small \(k\) (Q2235269) (← links)
• Spanning trees of bounded degree, connectivity, toughness, and the spectrum of a graph (Q2657863) (← links)
• Spectral conditions for edge connectivity and spanning tree packing number in (multi-)graphs (Q2689159) (← links)
• The vertex connectivity and the third largest eigenvalue in regular (multi-)graphs (Q6628841) (← links)
• Some results on \(\{K_2, C_{2i + 1} : i \geq 1\}\)-factor in a graph (Q6648250) (← links)