Algorithms computing O(n, Z)-orbits of P-critical edge-bipartite graphs and P-critical unit forms using Maple and C#

Algorithms computing O(n, Z)-orbits of P-critical edge-bipartite graphs and P-critical unit forms using Maple and C#

We present combinatorial algorithms constructing loop-free P-critical edge-bipartite (signed) graphs Δ′, with n ≥ 3 vertices, from pairs (Δ, w), with Δ a positive edge-bipartite graph having n-1 vertices and w a sincere root of Δ, up to an action ∗ : UBigrn × O(n, Z) → UBigrn of the orthogonal group...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Datum:2013
Hauptverfasser: Polak, A., Simson, D.
Format: Artikel
Sprache:English
Veröffentlicht: Інститут прикладної математики і механіки НАН України 2013
Schriftenreihe:Algebra and Discrete Mathematics
Online Zugang:http://dspace.nbuv.gov.ua/handle/123456789/152352
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Назва журналу:Digital Library of Periodicals of National Academy of Sciences of Ukraine
Zitieren:Algorithms computing O(n, Z)-orbits of P-critical edge-bipartite graphs and P-critical unit forms using Maple and C# / A. Polak, D. Simson // Algebra and Discrete Mathematics. — 2013. — Vol. 16, № 2. — С. 242–286. — Бібліогр.: 43 назв. — англ.

Institution

Digital Library of Periodicals of National Academy of Sciences of Ukraine

Ähnliche Einträge

Ähnliche Einträge