On the reduction of Yutsis graphs

DOI10.1016/j.disc.2005.11.088zbMath1115.68117OpenAlexW2165348883WikidataQ59411499 ScholiaQ59411499MaRDI QIDQ878649

Veerle Fack, Dries Van Dyck

Publication date: 26 April 2007

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2005.11.088

zbMATH Keywords

angular momentumcyclic structurereduction rulesgeneral recoupling coefficientYutsis graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (6)

Computing the largest bond and the maximum connected cut of a graph ⋮ A program for simplifying summation of Wigner \(3j\)-symbols ⋮ To be or not to be Yutsis: algorithms for the decision problem ⋮ Graph structural properties of non-Yutsis graphs allowing fast recognition ⋮ GYutsis ⋮ To be or not to be Yutsis

Uses Software

• NJFORMULA
• NEWGRAPH
• NJGRAF
• RACAH
• COEFANG1

Cites Work

• Unnamed Item
• Unnamed Item
• To be or not to be Yutsis: algorithms for the decision problem
• Calculation of general recoupling coefficients using graphical methods
• On the diameter of the rotation graph of binary coupling trees
• New efficient programs to calculate general recoupling coefficients. I: Generation of a summation formula
• A program for deriving recoupling coefficients formulae
• Depth-First Search and Linear Graph Algorithms
• Maple procedures for the coupling of angular momenta. V: Recoupling coefficients

This page was built for publication: On the reduction of Yutsis graphs