Pages that link to "Item:Q878373"
From MaRDI portal
The following pages link to Spanning trees on the Sierpinski gasket (Q878373):
Displaying 17 items.
- AVERAGE TRAPPING TIME ON THE 3-DIMENSIONAL 3-LEVEL SIERPINSKI GASKET NETWORK WITH A SET OF TRAP NODES (Q5046680) (← links)
- The localization of quantum random walks on Sierpinski gaskets (Q5056511) (← links)
- THE AVERAGE TRAPPING TIME WITH NON-NEAREST-NEIGHBOR JUMPS ON THE LEVEL-3 SIERPINSKI GASKET (Q5062371) (← links)
- Average trapping time on a type of horizontally segmented three dimensional Sierpinski gasket network with two types of locally self-similar structures (Q5066050) (← links)
- MAXIMUM MATCHINGS IN A PSEUDOFRACTAL SCALE-FREE WEB (Q5086261) (← links)
- COUNTING SPANNING TREES IN PRISM AND ANTI-PRISM GRAPHS (Q5121317) (← links)
- <i>q</i>-plane zeros of the Potts partition function on diamond hierarchical graphs (Q5140971) (← links)
- Mixing time and eigenvalues of the abelian sandpile Markov chain (Q5243105) (← links)
- Coherence in a family of tree networks with an application of Laplacian spectrum (Q5347030) (← links)
- (Q5387739) (← links)
- SPECTRAL ANALYSIS FOR WEIGHTED LEVEL-4 SIERPIŃSKI GRAPHS AND ITS APPLICATIONS (Q6114687) (← links)
- The Tutte polynomial of a class of compound graphs and its applications (Q6174137) (← links)
- Random walks on dual Sierpinski gaskets (Q6176639) (← links)
- Counting spanning trees of \((1, N\))-periodic graphs (Q6180568) (← links)
- Asymptotic behavior of a generalized independent sets model on the two-dimensional Sierpinski gasket (Q6564418) (← links)
- The number of spanning trees for Sierpiński graphs and data center networks (Q6614885) (← links)
- The mean time to absorption on horizontal partitioned Sierpinski gasket networks (Q6653973) (← links)