The number of spanning trees of a class of self-similar fractal models (Q1751423): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2018.04.004 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2796581768 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Loop-erased random walks, spanning trees and Hamiltonian cycles / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3097395 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2716030 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Deterministic scale-free networks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Spanning trees on graphs and lattices in<i>d</i>dimensions / rank | |||
Normal rank |
Latest revision as of 16:40, 15 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The number of spanning trees of a class of self-similar fractal models |
scientific article |
Statements
The number of spanning trees of a class of self-similar fractal models (English)
0 references
25 May 2018
0 references
complex network
0 references
self-similarity
0 references
spanning trees
0 references
recursive computational method
0 references
combinatorial problems
0 references