An inequality using perfect matchings and Laplacian spread of a graph (Q4622859): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/03081087.2017.1418823 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2908080082 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5387732 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interlacing eigenvalues and graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalues and 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

Latest revision as of 06:33, 18 July 2024

scientific article; zbMATH DE number 7024393
Language Label Description Also known as
English
An inequality using perfect matchings and Laplacian spread of a graph
scientific article; zbMATH DE number 7024393

    Statements

    An inequality using perfect matchings and Laplacian spread of a graph (English)
    0 references
    0 references
    0 references
    18 February 2019
    0 references
    Laplacian matrix
    0 references
    spread
    0 references
    matchings
    0 references

    Identifiers