Some methods for counting the spanning trees in labelled molecular graphs, examined in relation to certain fullerenes (Q1917322): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Mathematica / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5775371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4770409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dissection of rectangles into squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: T. L. Hill's graphical method for solving linear equations / 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: Matrix tree theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4088840 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5648382 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3907599 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3252408 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998309 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5572939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5554174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3835471 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3926613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873761 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random walks on random trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some determinant expansions and the matrix-tree theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3809819 / 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: Q5510191 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A NOTE ON THE ENUMERATION AND LISTING OF ALL POSSIBLE TREES IN A CONNECTED LINEAR GRAPH / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4047574 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4103134 / rank
 
Normal rank
Property / cites work
 
Property / cites work: General solution to the spanning tree enumeration problem in arbitrary multigraph joins / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3922685 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023140 / rank
 
Normal rank

Latest revision as of 13:09, 24 May 2024

scientific article
Language Label Description Also known as
English
Some methods for counting the spanning trees in labelled molecular graphs, examined in relation to certain fullerenes
scientific article

    Statements

    Some methods for counting the spanning trees in labelled molecular graphs, examined in relation to certain fullerenes (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    29 September 1996
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    matrix tree theorem
    0 references
    number of spanning trees
    0 references
    molecular graph
    0 references
    fullerenes
    0 references
    molecules
    0 references