On the number of spanning trees in graphs with multiple edges
type: Item
instance of: scholarly article
title: On the number of spanning trees in graphs with multiple edges
zbMATH Open document ID: 1373.05039
author: Hajar Sahbani
author: Mohamed El Marraki
published in: Journal of Applied Mathematics and Computing
publication date: 2017-11-10T00:00:00Z
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C30
zbMATH DE Number: 6805486
zbMATH Keywords: spanning trees
zbMATH Keywords: multiple edges
zbMATH Keywords: multi-edges-fan graph
zbMATH Keywords: multi-edges-wheel graph
MaRDI profile type: Publication
full work available at URL: s12190-016-1034-7
OpenAlex ID: W2471317570
cites work: Reliability Evaluation in Computer-Communication Networks
cites work: The number of spanning trees in \(K_ n\)-complements of quasi-threshold graphs
cites work: Loop-erased random walks, spanning trees and Hamiltonian cycles
cites work: Q4947393
cites work: Counting spanning trees in grid graphs
cites work: Q3517692
cites work: Q3551162
cites work: Spanning tree formulas and Chebyshev polynomials
cites work: The number of spanning trees of an infinite family of outerplanar, small-world and self-similar graphs
DOI: 10.1007/S12190-016-1034-7
description: scientific article; zbMATH DE number 6805486