Combinatorics of Petersen graph and its compositions for all irreducible representations for Jahn-Teller, non-rigid molecules and clusters

DOI10.1007/s10910-016-0634-7zbMath1359.92125OpenAlexW2347026090MaRDI QIDQ335925

Krishnan Balasubramanian

Publication date: 10 November 2016

Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10910-016-0634-7

zbMATH Keywords

Petersen graphcolorings Petersen graphcombinatorial enumerationscompositions of Petersen graphsPólya theorywreath product \(\mathrm S_{5}(10)[\mathrm S_{2}\) group]

Mathematics Subject Classification ID

Applications of graph theory (05C90) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Use of the Szeged index and the revised Szeged index for measuring network bipartivity
• On the group of the composition of two graphs
• Pattern inventories associated with symmetry classes of tensors
• Multinomial combinatorial group representations of the octahedral and cubic symmetries
• Configurations from a Graphical Viewpoint
• Kronecker covers, V-construction, unit-distance graphs and isometric point-circle configurations
• Color patterns that are invariant under a given permutation of the colors