Per-spectral characterizations of graphs with extremal per-nullity (Q491098): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q5396536 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3070763 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3703924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of graphs with rank 4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of graphs with rank 5 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4830188 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the nullity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4903435 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3907599 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which graphs are determined by their spectrum? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Developments on spectral characterizations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5508779 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2867619 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4800134 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cospectral Graphs and Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the characterizing properties of the permanental polynomials of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing properties of permanental polynomials of lollipop graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permanental polynomials of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the permanental polynomials of some graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the permanental polynomials of bipartite graphs by Pfaffian orientation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the permanental roots of bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Per-spectral characterizations of some edge-deleted subgraphs of a complete graph / rank
 
Normal rank

Revision as of 16:02, 10 July 2024

scientific article
Language Label Description Also known as
English
Per-spectral characterizations of graphs with extremal per-nullity
scientific article

    Statements

    Per-spectral characterizations of graphs with extremal per-nullity (English)
    0 references
    0 references
    0 references
    24 August 2015
    0 references
    permanental polynomial
    0 references
    per-spectrum
    0 references
    nullity
    0 references
    per-nullity
    0 references

    Identifiers