The number of spanning trees in a new lexicographic product of graphs

DOI10.1007/s11432-014-5110-zzbMath1398.05111OpenAlexW2261839782MaRDI QIDQ1616174

R. Smith

Publication date: 1 November 2018

Published in: Science China. Information Sciences (Search for Journal in Brave)

Full work available at URL: http://engine.scichina.com/doi/10.1007/s11432-014-5110-z

zbMATH Keywords

Laplacian matrixlexicographic productspanning treesreliable network

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Unnamed Item
• On the number of spanning trees of a multi-complete/star related graph
• Graphs determined by their generalized characteristic polynomials
• Some results on the lexicographic product of vertex-transitive graphs
• Cyclic arc-connectivity in a Cartesian product digraph
• Spanning tree formulas and Chebyshev polynomials
• Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design theory
• Associative products of graphs
• A certain polynomial of a graph and graphs with an extremal number of trees
• The number of spanning trees in circulant graphs
• Laplacian spectra and spanning trees of threshold graphs
• Heavy cycles and spanning trees with few leaves in weighted graphs
• On Some Graph Operations and Related Applications
• Pose-Invariant Face Recognition Using Markov Random Fields

This page was built for publication: The number of spanning trees in a new lexicographic product of graphs