Pages that link to "Item:Q2449073"
From MaRDI portal
The following pages link to The number of spanning trees in Apollonian networks (Q2449073):
Displaying 29 items.
- Tutte polynomial of scale-free networks (Q301807) (← links)
- On constructing rational spanning tree edge densities (Q313824) (← links)
- On the number of spanning trees, the Laplacian eigenvalues, and the Laplacian Estrada index of subdivided-line graphs (Q317939) (← links)
- The number and degree distribution of spanning trees in the Tower of Hanoi graph (Q897918) (← links)
- Enumeration of spanning trees on contact graphs of disk packings (Q1618515) (← links)
- Maximum matchings and minimum dominating sets in Apollonian networks and extended tower of Hanoi graphs (Q1676361) (← links)
- An iteration method for computing the total number of spanning trees and its applications in graph theory (Q1686071) (← links)
- Enumeration of spanning trees in the sequence of Dürer graphs (Q1698483) (← links)
- Potts model partition functions on two families of fractal lattices (Q1783100) (← links)
- Correct proof of the main result in ``The number of spanning trees of a class of self-similar fractal models'' by Ma and Yao (Q2032156) (← links)
- The relations between network-operation and topological-property in a scale-free and small-world network with community structure (Q2147746) (← links)
- A class of vertex-edge-growth small-world network models having scale-free, self-similar and hierarchical characters (Q2148240) (← links)
- A family of small-world network models built by complete graph and iteration-function (Q2148313) (← links)
- Generating Fibonacci-model as evolution of networks with vertex-velocity and time-memory (Q2161760) (← links)
- Strong geodetic problem in networks (Q2282484) (← links)
- Computing the number of \(k\)-component spanning forests of a graph with bounded treewidth (Q2314068) (← links)
- Laplacian spectra for categorical product networks and its applications (Q2333608) (← links)
- Pfaffian orientations and perfect matchings of scale-free networks (Q2514127) (← links)
- A method to calculate the number of spanning connected unicyclic(bicyclic) subgraphs in 2-separable networks (Q2672618) (← links)
- Tutte polynomial of the Apollonian network (Q3301779) (← links)
- Volume Bounds for the Phase-Locking Region in the Kuramoto Model with Asymmetric Coupling (Q4983507) (← links)
- COUNTING SPANNING TREES IN PRISM AND ANTI-PRISM GRAPHS (Q5121317) (← links)
- Random growth networks with exponential degree distribution (Q5140890) (← links)
- LEADER–FOLLOWER COHERENCE OF THE WEIGHTED RECURSIVE TREE NETWORKS (Q5864132) (← links)
- Modeling spatial networks by contact graphs of disk packings (Q6093578) (← links)
- Spectral analysis of weighted neighborhood networks (Q6132887) (← links)
- Computing the number and average size of connected sets in planar 3-trees (Q6540641) (← links)
- Random growth scale-free networked models with an identical degree distribution and a tunable assortativity index (Q6558034) (← links)
- The number of spanning trees for Sierpiński graphs and data center networks (Q6614885) (← links)
