Polya's Counting Theorem Via Tensors

DOI10.2307/2320463MaRDI QIDQ3919741zbMATH OpenOpenAlexFDO

Authors Russell Merris

Publication date 1981

Published in The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2320463

zbMATH Keywords

Burnside's lemmacycle indexPolya's counting theoremtensors

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Vector and tensor algebra, theory of invariants (15A72)

Cited in

(2)

• Enumeration of substitutional isomers with restrictive mutual positions of ligands. II. Counts with restrictions on (sub)symmetry
• Tensors and Graphs

This page was built for publication: Polya's Counting Theorem Via Tensors

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