Pages that link to "Item:Q3466350"
From MaRDI portal
The following pages link to Edge-Disjoint Spanning Trees, Edge Connectivity, and Eigenvalues in Graphs (Q3466350):
Displaying 35 items.
- Fractional spanning tree packing, forest covering and eigenvalues (Q313822) (← links)
- Edge-disjoint spanning trees and eigenvalues of regular graphs (Q426054) (← links)
- Spectral conditions for some graphical properties (Q526290) (← links)
- Spectral conditions for edge connectivity and packing spanning trees in multigraphs (Q905705) (← links)
- Edge-disjoint minimum-weight connected spanning \(k\)-edge subgraphs in a weighted graph: A connectedness theorem (Q1584336) (← links)
- Maximizing the spectral radius of graphs with fixed minimum degree and edge connectivity (Q1688910) (← links)
- Spectral radius and \(k\)-connectedness of a graph (Q1744085) (← links)
- Vertex-connectivity and eigenvalues of graphs with fixed girth (Q2008368) (← links)
- Spectral conditions for graph rigidity in the Euclidean plane (Q2043397) (← links)
- The maximum spectral radius of non-bipartite graphs forbidding short odd cycles (Q2094864) (← links)
- Extremal graphs for a spectral inequality on edge-disjoint spanning trees (Q2152797) (← links)
- Toughness in pseudo-random graphs (Q2225447) (← links)
- Connectivity and eigenvalues of graphs with given girth or clique number (Q2226409) (← links)
- Fractional arboricity, strength and eigenvalues of graphs with fixed girth or clique number (Q2228493) (← links)
- Note on edge-disjoint spanning trees and eigenvalues (Q2250921) (← links)
- Vertex-connectivity and eigenvalues of graphs (Q2272481) (← links)
- Spanning tree packing number and eigenvalues of graphs with given girth (Q2321370) (← links)
- Edge-disjoint spanning trees and eigenvalues of graphs (Q2435485) (← links)
- Edge-disjoint spanning trees and eigenvalues (Q2442253) (← links)
- Edge-disjoint spanning trees for the generalized butterfly networks and their applications (Q2575864) (← links)
- Spanning trees of bounded degree, connectivity, toughness, and the spectrum of a graph (Q2657863) (← links)
- Sharp spectral bounds for the vertex-connectivity of regular graphs (Q2687918) (← links)
- Spectral conditions for edge connectivity and spanning tree packing number in (multi-)graphs (Q2689159) (← links)
- Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs (Q2828824) (← links)
- On Edge-Disjoint Spanning Trees in a Randomly Weighted Complete Graph (Q4643315) (← links)
- Edge connectivity, packing spanning trees, and eigenvalues of graphs (Q5134961) (← links)
- Fractional matching number and eigenvalues of a graph (Q5240735) (← links)
- Group Connectivity, Strongly Z_m-Connectivity, and Edge Disjoint Spanning Trees (Q5351870) (← links)
- (Q5506265) (← links)
- Spectral radius conditions for the rigidity of graphs (Q6046220) (← links)
- Spectral radius and edge‐disjoint spanning trees (Q6084711) (← links)
- Graph rigidity properties of Ramanujan graphs (Q6133153) (← links)
- Extremal spectral radius and essential edge-connectivity (Q6494930) (← links)
- The \(Q\)-index and connectivity of graphs (Q6566794) (← links)
- \(l\)-connectivity, \(l\)-edge-connectivity and spectral radius of graphs (Q6639846) (← links)