An analogue of Cayley's theorem for cyclically symmetric connected graphs with a single cycle that are associated with generalized Lyashko-Looijenga covers

DOI10.1070/RM1993V048N04ABEH001059MaRDI QIDQ4323904zbMATHOpenAlexFDO

Authors

Publication date 9 March 1995

Published in Russian Mathematical Surveys (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1070/rm1993v048n04abeh001059

zbMATH Keywords

equivalence classesnumber of spanning treesCayley's theoremequivariant complex polynomialsLyashko-Looijenga covers

Mathematics Subject Classification ID

Trees (05C05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Enumeration in graph theory (05C30) Paths and cycles (05C38) Enumerative problems (combinatorial problems) in algebraic geometry (14N10)

Recommendations

• Nikolai Ivanovich Lobachevskii (on the bicentenary of his birth)
• On Cayley's formula for counting trees in nested interval graphs
• The poset of subpartitions and Cayley's formula for the complexity of a complete graph
• Bijections for Cayley trees, spanning trees, and their q-analogues
• Cycles and spanning trees

This page was built for publication: An analogue of Cayley's theorem for cyclically symmetric connected graphs with a single cycle that are associated with generalized Lyashko-Looijenga covers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4323904)