Sharp uppper and lower bounds on the number of spanning trees in Cartesian product graphs

DOI10.7151/dmgt.1698zbMath1295.05199arXiv1210.6340OpenAlexW2156082994MaRDI QIDQ5495059

Jernej Azarija

Publication date: 30 July 2014

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1210.6340

zbMATH Keywords

inequalitynumber of spanning treesCartesian product graphsspanning trees

Mathematics Subject Classification ID

Trees (05C05) Graph operations (line graphs, products, etc.) (05C76)

This page was built for publication: Sharp uppper and lower bounds on the number of spanning trees in Cartesian product graphs