Counting spanning trees in self-similar networks by evaluating determinants (Q2851758): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Yu-An Lin / rank
Normal rank
 
Property / author
 
Property / author: Guan-Rong Chen / rank
Normal rank
 
Property / author
 
Property / author: Yu-An Lin / rank
 
Normal rank
Property / author
 
Property / author: Guan-Rong Chen / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2014875954 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1105.0565 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local characteristics, entropy and limit theorems for spanning trees and domino tilings via transfer-impedances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting Minimum Weight Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic Enumeration of Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Growth of the Number of Spanning Trees of the Erdős–Rényi Giant Component / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees on graphs and lattices in<i>d</i>dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: High-precision entropy values for spanning trees in lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees on the Sierpinski gasket / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of spanning trees on various lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resistance scaling and the number of spanning trees in self-similar lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: MOD-CHAR: an implementation of Char's spanning tree enumeration algorithm and its complexity analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: On unreliability polynomials and graph connectivity in reliable network synthesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometry of minimum spanning trees on scale-free networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of some network reliability analysis and synthesis results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-organized critical state of sandpile automaton models / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chip-firing game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resistance distance in wheels and fans / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning Trees and Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: DIMERS AND SPANNING TREES: SOME RECENT RESULTS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding Spanning Trees in Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix tree theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4770409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Emergence of Scaling in Random Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The average distances in random graphs with given expected degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collective dynamics of ‘small-world’ networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical mechanics of complex networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Structure and Function of Complex Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverted Berezinskii-Kosterlitz-Thouless singularity and high-temperature algebraic order in an Ising model on a scale-free hierarchical-lattice small-world network / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hierarchical product of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mapping Koch curves into scale-free small-world networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Apollonian Packing of Circles / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:58, 6 July 2024

scientific article
Language Label Description Also known as
English
Counting spanning trees in self-similar networks by evaluating determinants
scientific article

    Statements

    Counting spanning trees in self-similar networks by evaluating determinants (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    2 October 2013
    0 references
    Laplacian matrix
    0 references
    \((x, y)\)-flowers
    0 references
    spanning trees
    0 references
    computing determinants
    0 references
    self-similar networks
    0 references
    0 references
    0 references
    0 references

    Identifiers

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