COUNTING SPANNING TREES IN PRISM AND ANTI-PRISM GRAPHS
From MaRDI portal
Publication:5121317
DOI10.11948/2016006zbMath1463.05287OpenAlexW2179119116MaRDI QIDQ5121317
Jingyuan Zhang, Shuai Wang, Wei-Gang Sun
Publication date: 14 September 2020
Published in: Journal of Applied Analysis & Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.11948/2016006
Related Items (max. 100)
Counting spanning trees in cobordism of two circulant graphs ⋮ On Jacobian group and complexity of the generalized Petersen graph \(\mathrm{GP}(n,k)\) through Chebyshev polynomials ⋮ The number of rooted forests in circulant graphs ⋮ WEIGHT-DEPENDENT WALKS AND AVERAGE SHORTEST WEIGHTED PATH ON THE WEIGHTED ITERATED FRIENDSHIP GRAPHS ⋮ Parameter identification based on lag synchronization via hybrid feedback control in uncertain drive-response dynamical networks ⋮ Complexity of circulant graphs with non-fixed jumps, its arithmetic properties and asymptotics ⋮ On the number of spanning trees, the Laplacian eigenvalues, and the Laplacian Estrada index of subdivided-line graphs ⋮ Eigentime identities for random walks on a family of treelike networks and polymer networks ⋮ Spectral analysis for weighted tree-like fractals ⋮ Spectral analysis for a family of treelike networks ⋮ A discrete random walk on the hypercube ⋮ Eigentime identity of the weighted scale-free triangulation networks for weight-dependent walk ⋮ FIRST-ORDER NETWORK COHERENCE AND EIGENTIME IDENTITY ON THE WEIGHTED CAYLEY NETWORKS ⋮ SCALING PROPERTIES OF FIRST RETURN TIME ON WEIGHTED TRANSFRACTALS (1,3)-FLOWERS ⋮ CHARACTERISTIC POLYNOMIAL OF ADJACENCY OR LAPLACIAN MATRIX FOR WEIGHTED TREELIKE NETWORKS ⋮ Enumeration of spanning trees in prisms of some graphs ⋮ SPECTRAL ANALYSIS FOR WEIGHTED LEVEL-4 SIERPIŃSKI GRAPHS AND ITS APPLICATIONS ⋮ On the Jacobian group of a cone over a circulant graph ⋮ EIGENTIME IDENTITY FOR WEIGHT-DEPENDENT WALK ON A CLASS OF WEIGHTED FRACTAL SCALE-FREE HIERARCHICAL-LATTICE NETWORKS ⋮ Enumeration of spanning trees in the sequence of Dürer graphs ⋮ Cyclic coverings of graphs. Counting rooted spanning forests and trees, Kirchhoff index, and Jacobians ⋮ Anti-synchronization Between Two Coupled Networks with Unknown Parameters Using Adaptive and Pinning Controls ⋮ On Jacobian group and complexity of I-graph I(n, k, l) through Chebyshev polynomials ⋮ The evaluation of the number and the entropy of spanning trees on generalized small-world networks ⋮ The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic ⋮ Complexity of the circulant foliation over a graph ⋮ Intermittent control for cluster-delay synchronization in directed networks ⋮ EIGENTIME IDENTITY OF THE WEIGHTED KOCH NETWORKS ⋮ Eigentime identities for on weighted polymer networks ⋮ SPECTRAL ANALYSIS FOR WEIGHTED ITERATED TRIANGULATIONS OF GRAPHS ⋮ Number of spanning trees in the sequence of some graphs ⋮ Counting rooted spanning forests in cobordism of two circulant graphs ⋮ Complexity of discrete Seifert foliations over a graph ⋮ LEADER–FOLLOWER COHERENCE OF THE WEIGHTED RECURSIVE TREE NETWORKS ⋮ Eigenvalues of transition weight matrix for a family of weighted networks
Cites Work
- Unnamed Item
- Unnamed Item
- Weighted spanning trees on some self-similar graphs
- The number of spanning trees in self-similar graphs
- Local characteristics, entropy and limit theorems for spanning trees and domino tilings via transfer-impedances
- The number of spanning trees in \(K_ n\)-complements of quasi-threshold graphs
- Spanning trees on the Sierpinski gasket
- Determinant identities for Laplace matrices
- The number of spanning trees of an infinite family of outerplanar, small-world and self-similar graphs
- Enumeration of spanning trees in planar unclustered networks
- The problem of the optimal biobjective spanning tree
- Dimers on a simple-quartic net with a vacancy
- The number of spanning trees in Apollonian networks
- Counting spanning trees in self-similar networks by evaluating determinants
- On the number of spanning trees on various lattices
- Spanning Trees and Optimization Problems
- Spanning trees on graphs and lattices inddimensions
- The number of spanning trees in a prism
- Asymptotic Enumeration of Spanning Trees
This page was built for publication: COUNTING SPANNING TREES IN PRISM AND ANTI-PRISM GRAPHS
