Graphs with six distinct matching roots (Q2339593): 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.1016/j.ipl.2014.10.012 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2008751850 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The matching polynomial of a regular graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent results in the theory of graph spectra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with few matching roots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of monomer-dimer systems / rank
 
Normal rank

Latest revision as of 23:04, 9 July 2024

scientific article
Language Label Description Also known as
English
Graphs with six distinct matching roots
scientific article

    Statements

    Graphs with six distinct matching roots (English)
    0 references
    0 references
    0 references
    0 references
    2 April 2015
    0 references
    graph algorithms
    0 references
    matching polynomial
    0 references
    matching equivalent
    0 references
    matching unique
    0 references

    Identifiers