Research graph
References from Sufficient Conditions for Spanning k ‐Hypertrees via Distance Spectral Radius of Hypergraphs. Local targets link to admitted publications; unresolved targets remain external evidence.
On a Connection Between the Existence of k-Trees and the Toughness of a Graph
10.1007/bf01788671 · 1989 · External reference
The Spanning k-Trees, Perfect Matchings and Spectral Radius of Graphs
10.1080/03081087.2021.1985055 · 2021 · External reference
Spanning k-Tree and Distance Spectral Radius in Graphs
10.1007/s11227-024-06355-8 · 2024 · External reference
Spanning k-Tree and Distance Signless Laplacian Spectral Radius of Graphs
10.1016/j.dam.2024.07.010 · 2024 · External reference
On the Largest Tree of Given Maximum Degree in a Connected Graph
10.1002/jgt.3190150103 · 1991 · External reference
A Sufficient Condition for a Graph to Have a k-Tree
10.1007/s003730170059 · 2001 · External reference
Toughness, Trees, and Walks
10.1002/(sici)1097-0118(200003)33:3<125::aid-jgt1>3.0.co;2-x · 2000 · External reference
Degrees of Acyclicity for Hypergraphs and Relational Database Schemes
10.1145/2402.322390 · 1983 · External reference
Unresolved reference
1989 · External reference
Unresolved reference
2009 · External reference
Spectral Radius and Spanning Trees of Graphs
2023 · External reference
Syntactic Characterization of Tree Database Schemas
1985 · External reference
Equitable Partition Theorem of Tensors and Spectrum of Generalized Power Hypergraphs
10.1016/j.laa.2018.06.002 · 2018 · External reference
Distance (Signless) Laplacian Spectral Radius of Uniform Hypergraphs
10.1016/j.laa.2017.04.020 · 2017 · External reference
