Matrix-tree theorem of digraphs via signless Laplacians (Q2104963): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q122147632, #quickstatements; #temporary_batch_1711439739529
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Spectra of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combinatorial Proof of the All Minors Matrix Tree Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of spanning trees of the Bruhat graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Cantor-Bernstein-type theorem for spanning trees in infinite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analog of matrix tree theorem for signless Laplacians / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Elementary Proof of a Matrix Tree Theorem for Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees in random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Line-digraphs, arborescences and theorems of Tutte and Knuth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5786986 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting spanning trees of a type of generalized Farey graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4485695 / rank
 
Normal rank

Revision as of 00:38, 31 July 2024

scientific article
Language Label Description Also known as
English
Matrix-tree theorem of digraphs via signless Laplacians
scientific article

    Statements

    Matrix-tree theorem of digraphs via signless Laplacians (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    8 December 2022
    0 references
    digraphs
    0 references
    spanning tree
    0 references
    matrix-tree theorem
    0 references
    Laplacian
    0 references
    signless Laplacian
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references