The number of spanning trees in the composition graphs
type: Item
instance of: scholarly article
title: The number of spanning trees in the composition graphs
zbMATH Open document ID: 1407.05131
DOI: 10.1155/2014/613685
author: Xianqiang Yang
published in: Mathematical Problems in Engineering
publication date: 2019-02-08T00:00:00Z
review text: Summary: Using the composition of some existing smaller graphs to construct some large graphs, the number of spanning trees and the Laplacian eigenvalues of such large graphs are also closely related to those of the corresponding smaller ones. By using tools from linear algebra and matrix theory, we establish closed formulae for the number of spanning trees of the composition of two graphs with one of them being an arbitrary complete 3-partite graph and the other being an arbitrary graph. Our results extend some of the previous work, which depend on the structural parameters such as the number of vertices and eigenvalues of the small graphs only.
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 7016862
Wikidata QID: Q59066569
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2014/613685
OpenAlex ID: W2042732675
cites work: Spanning tree formulas and Chebyshev polynomials
cites work: A survey of some network reliability analysis and synthesis results
cites work: On the characterization of graphs with maximum number of spanning trees
cites work: The number of spanning trees in circulant graphs
cites work: On the number of spanning trees of a multi-complete/star related graph
cites work: Maximizing spanning trees in almost complete graphs
cites work: Laplacian spectra and spanning trees of threshold graphs
cites work: A certain polynomial of a graph and graphs with an extremal number of trees
cites work: On some graph operations and related applications
cites work: Eigenvalues of nonnegative symmetric matrices
cites work: A generalization of Fiedler's lemma and some applications
cites work: Some results on the lexicographic product of vertex-transitive graphs
cites work: Graphs determined by their generalized characteristic polynomials
cites work: Q4387956
cites work: Q5602686
description: scientific article; zbMATH DE number 7016862