Euler's idoneal numbers and an inequality concerning minimal graphs with a prescribed number of spanning trees

DOI10.21136/mb.2013.143285zbMath1289.05043arXiv1210.6335OpenAlexW2962801496MaRDI QIDQ2856915

Jernej Azarija, Riste Škrekovski

Publication date: 30 October 2013

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

zbMATH Keywords

spanning tree

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30)

Related Items (1)

Counting graphs with different numbers of spanning trees through the counting of prime partitions

This page was built for publication: Euler's idoneal numbers and an inequality concerning minimal graphs with a prescribed number of spanning trees