The number of spanning trees in a new lexicographic product of graphs
type: Item
instance of: scholarly article
title: The number of spanning trees in a new lexicographic product of graphs
zbMATH Open document ID: 1398.05111
author: R. Smith
publication date: 2018-11-01T00:00:00Z
full work available at URL: s11432-014-5110-z
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C76
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C50
zbMATH DE Number: 6969828
zbMATH Keywords: spanning trees
zbMATH Keywords: lexicographic product
zbMATH Keywords: Laplacian matrix
zbMATH Keywords: reliable network
MaRDI profile type: Publication
OpenAlex ID: W2261839782
cites work: Pose-Invariant Face Recognition Using Markov Random Fields
cites work: Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design theory
cites work: Heavy cycles and spanning trees with few leaves in weighted graphs
cites work: Q4387956
cites work: The number of spanning trees in circulant graphs
cites work: Spanning tree formulas and Chebyshev polynomials
cites work: On the number of spanning trees of a multi-complete/star related graph
cites work: Laplacian spectra and spanning trees of threshold graphs
cites work: Associative products of graphs
cites work: Cyclic arc-connectivity in a Cartesian product digraph
cites work: Some results on the lexicographic product of vertex-transitive graphs
cites work: On some graph operations and related applications
cites work: Q5602686
cites work: A certain polynomial of a graph and graphs with an extremal number of trees
cites work: Graphs determined by their generalized characteristic polynomials
DOI: 10.1007/S11432-014-5110-Z
published in: Science China Information Sciences
description: scientific article; zbMATH DE number 6969828