Graphs with few matching roots (Q367053): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C31 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C70 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6211649 / rank
 
Normal rank
Property / zbMATH Keywords
 
matching polynomial
Property / zbMATH Keywords: matching polynomial / rank
 
Normal rank
Property / zbMATH Keywords
 
matching unique graph
Property / zbMATH Keywords: matching unique graph / rank
 
Normal rank
Property / zbMATH Keywords
 
comatching graphs
Property / zbMATH Keywords: comatching graphs / rank
 
Normal rank
Property / zbMATH Keywords
 
friendship graph
Property / zbMATH Keywords: friendship graph / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2130641009 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1011.0284 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on graphs whose signless Laplacian has three distinct eigenvalues / 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: Multiplicative cones - a family of three eigenvalue graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectra of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analogue of the Gallai-Edmonds structure theorem for non-zero roots of the matching polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonregular graphs with three eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with constant \(\mu\) and \(\overline{\mu}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small regular graphs with four eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: GRAPHS WITH A SMALL NUMBER OF DISTINCT EIGENVALUES / rank
 
Normal rank
Property / cites work
 
Property / cites work: On characterizing certain graphs with four eigenvalues by their spectra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3137758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the theory of the matching polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of monomer-dimer systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs with three eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs determined by polynomial invariants / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:44, 6 July 2024

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

    Statements

    Graphs with few matching roots (English)
    0 references
    0 references
    26 September 2013
    0 references
    0 references
    matching polynomial
    0 references
    matching unique graph
    0 references
    comatching graphs
    0 references
    friendship graph
    0 references
    0 references
    0 references