On the characterizing properties of the permanental polynomials of graphs (Q1932591): 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: Q3703924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3039393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4830188 / 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: On matching coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problems in algebraic combinatorics / 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: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permanental polynomials of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Matrix Functions and the Graph Isomorphism Problem / 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

Revision as of 02:24, 6 July 2024

scientific article
Language Label Description Also known as
English
On the characterizing properties of the permanental polynomials of graphs
scientific article

    Statements

    On the characterizing properties of the permanental polynomials of graphs (English)
    0 references
    0 references
    0 references
    21 January 2013
    0 references
    permanent
    0 references
    permanental polynomial
    0 references

    Identifiers