The number of spanning trees of a family of 2-separable weighted graphs

DOI10.1016/j.dam.2017.05.003zbMath1367.05095OpenAlexW2624116780MaRDI QIDQ2012069

Helin Gong, Shuli Li

Publication date: 27 July 2017

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2017.05.003

zbMATH Keywords

spanning treeweighted graphelectrically equivalent transformation2-separable graph

Mathematics Subject Classification ID

Trees (05C05) Signed and weighted graphs (05C22)

Related Items (4)

Enumeration of spanning trees of 2-separable networks ⋮ Entropy and enumeration of spanning connected unicyclic subgraphs in self-similar network ⋮ A method to calculate the number of spanning connected unicyclic(bicyclic) subgraphs in 2-separable networks ⋮ Unnamed Item

Cites Work

• Resistance distance-based graph invariants of subdivisions and triangulations of graphs
• Spanning trees and orientation of graphs
• Resistance scaling and the number of spanning trees in self-similar lattices
• On the number of matchings of graphs formed by a graph operation
• Zeros of the Jones polynomial are dense in the complex plane
• On the matching polynomial of subdivision graphs
• Enumerating spanning trees of graphs with an involution
• Determinant identities for Laplace matrices
• Forests, colorings and acyclic orientations of the square lattice
• Tutte polynomial expansions for 2-separable graphs
• Acyclic orientations of graphs
• A Combinatorial Proof of the All Minors Matrix Tree Theorem
• Expression for the Number of Spanning Trees of Line Graphs of Arbitrary Connected Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The number of spanning trees of a family of 2-separable weighted graphs