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

DOI10.1016/J.DAM.2017.05.003zbMATH Open1367.05095OpenAlexW2624116780MaRDI QIDQ2012069FDOQ2012069

Authors: 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

Recommendations

• The enumeration of spanning tree of weighted graphs
• The number of spanning trees of a family of plane graph
• Linear algebraic techniques for weighted spanning tree enumeration
• Number of spanning trees in the sequence of some graphs
• Enumerating spanning trees of graphs with an involution

zbMATH Keywords

spanning treeweighted graphelectrically equivalent transformation2-separable graph

Mathematics Subject Classification ID

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

Cites Work

• Graph theory
• Title not available (Why is that?)
• Acyclic orientations of graphs
• Resistance distance-based graph invariants of subdivisions and triangulations of graphs
• Tutte polynomial expansions for 2-separable graphs
• A Combinatorial Proof of the All Minors Matrix Tree Theorem
• On the matching polynomial of subdivision graphs
• Forests, colorings and acyclic orientations of the square lattice
• Enumerating spanning trees of graphs with an involution
• Determinant identities for Laplace matrices
• Title not available (Why is that?)
• Spanning trees and orientation of graphs
• On the number of matchings of graphs formed by a graph operation
• Zeros of the Jones polynomial are dense in the complex plane
• Resistance scaling and the number of spanning trees in self-similar lattices
• Asymptotic enumeration on self-similar graphs with two boundary vertices
• Title not available (Why is that?)
• Expression for the number of spanning trees of line graphs of arbitrary connected graphs

Cited In (6)

• The enumeration of spanning tree of weighted graphs
• Mayer and Ree-Hoover weights of infinite families of 2-connected graphs
• 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
• Tutte polynomial of tensor product graph and its applications

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2012069)