The number of spanning trees of a family of 2-separable weighted graphs
type: Item
instance of: scholarly article
title: The number of spanning trees of a family of 2-separable weighted graphs
zbMATH Open document ID: 1367.05095
author: Helin Gong
author: Shuli Li
published in: Discrete Applied Mathematics
publication date: 2017-07-27T00:00:00Z
Mathematics Subject Classification ID: 05C22
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 6754401
zbMATH Keywords: weighted graph
zbMATH Keywords: spanning tree
zbMATH Keywords: 2-separable graph
zbMATH Keywords: electrically equivalent transformation
MaRDI profile type: Publication
full work available at URL: j.dam.2017.05.003
OpenAlex ID: W2624116780
cites work: Q4398864
cites work: Q5422499
cites work: A Combinatorial Proof of the All Minors Matrix Tree Theorem
cites work: Expression for the Number of Spanning Trees of Line Graphs of Arbitrary Connected Graphs
cites work: Zeros of the Jones polynomial are dense in the complex plane
cites work: Forests, colorings and acyclic orientations of the square lattice
cites work: Q4717848
cites work: Acyclic orientations of graphs
cites work: Q3176622
cites work: Q3575442
cites work: Determinant identities for Laplace matrices
cites work: Resistance scaling and the number of spanning trees in self-similar lattices
cites work: Spanning trees and orientation of graphs
cites work: Tutte polynomial expansions for 2-separable graphs
cites work: On the number of matchings of graphs formed by a graph operation
cites work: On the matching polynomial of subdivision graphs
cites work: Resistance distance-based graph invariants of subdivisions and triangulations of graphs
cites work: Enumerating spanning trees of graphs with an involution
DOI: 10.1016/J.DAM.2017.05.003
description: scientific article; zbMATH DE number 6754401