Edge-Disjoint Spanning Trees, Edge Connectivity, and Eigenvalues in Graphs (Q3466350): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Spectra of graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Eigenvalues and edge-connectivity of regular graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Edge-disjoint spanning trees and eigenvalues of regular graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Connectivity and edge-disjoint spanning trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Interlacing eigenvalues and graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Edge-Disjoint Spanning Trees of Finite Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the spanning tree packing number of a graph: A survey / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the Problem of Decomposing a Graph into <i>n</i> Connected Factors / rank | |||
Normal rank | |||
Latest revision as of 09:24, 11 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Edge-Disjoint Spanning Trees, Edge Connectivity, and Eigenvalues in Graphs |
scientific article |
Statements
Edge-Disjoint Spanning Trees, Edge Connectivity, and Eigenvalues in Graphs (English)
0 references
1 February 2016
0 references
eigenvalue
0 references
adjacency matrix
0 references
Laplacian matrix
0 references
signless Laplacian matrix
0 references
quotient matrix
0 references
edge connectivity
0 references
edge-disjoint spanning trees
0 references
spanning-tree packing number
0 references
