Computer Algebra in Scientific Computing

DOI10.1007/11555964zbMATH Open1169.05329OpenAlexW4300628649MaRDI QIDQ5479237FDOQ5479237

Authors: Domingo Gomez, Jaime Gutierrez, Álvar Ibeas 

Publication date: 7 July 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11555964

Recommendations

• Cayley Digraphs of Finite Abelian Groups and Monomial Ideals
• Triple-loop networks with arbitrarily many minimum distance diagrams
• Diameter of some monomial digraphs
• Cycles, Paths, Connectivity and Diameter in Distance Graphs
• The optimal diameter of \(2\)-circulant digraphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph theory (including graph drawing) in computer science (68R10) Symbolic computation and algebraic computation (68W30) Graph representations (geometric and intersection representations, etc.) (05C62) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25)

Cited In (4)

• Optimal routing in double loop networks
• Monomial bases for broken circuit complexes
• Monomial ideals of graphs with loops
• Cayley Digraphs of Finite Abelian Groups and Monomial Ideals

This page was built for publication: Computer Algebra in Scientific Computing

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