The spanning <i>k</i>-trees, perfect matchings and spectral radius of graphs (Q5888899): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W3205998195 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees with many leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning spiders and light-splitting switches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737170 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees with bounded degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a connection between the existence of k-trees and the toughness of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toughness, trees, and walks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral radius and Hamiltonian properties of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient spectral conditions on Hamiltonian and traceable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalues and perfect matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the spectral radius of unicyclic graphs with perfect matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5481401 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large matchings from eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matchings in regular graphs from eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the signless Laplacian index of cacti with a given number of pendant vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral radius and matchings in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4382863 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral radius and fractional matchings in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signless Laplacian spectral radius and fractional matchings in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional matching number and eigenvalues of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the spectral radius of graphs with cut edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2716030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bound on the spectral radius of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing the sum of the squares of the degrees of a graph / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:40, 31 July 2024

scientific article; zbMATH DE number 7678740
Language Label Description Also known as
English
The spanning <i>k</i>-trees, perfect matchings and spectral radius of graphs
scientific article; zbMATH DE number 7678740

    Statements

    The spanning <i>k</i>-trees, perfect matchings and spectral radius of graphs (English)
    0 references
    0 references
    0 references
    0 references
    25 April 2023
    0 references
    \(k\)-tree
    0 references
    perfect matching
    0 references
    spectral radius
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references