On the structure of loop-free non-negative edge-bipartite graphs

DOI10.1016/j.laa.2019.06.002zbMath1419.05101OpenAlexW2948639862WikidataQ127744063 ScholiaQ127744063MaRDI QIDQ2272490

Katarzyna Zając

Publication date: 10 September 2019

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2019.06.002

zbMATH Keywords

signed graphGram matrixCoxeter spectrumCoxeter matrixedge-bipartite graphEuclidean diagram

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Combinatorics in computer science (68R05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Quadratic and bilinear forms, inner products (15A63) Algebraic aspects of posets (06A11) Signed and weighted graphs (05C22)

Related Items (8)

On algorithmic Coxeter spectral analysis of positive posets ⋮ On polynomial time inflation algorithm for loop-free non-negative edge-bipartite graphs ⋮ Quadratic algorithm to compute the Dynkin type of a positive definite quasi-Cartan matrix ⋮ On mesh geometries of root Coxeter orbits and mesh algorithms for corank two edge-bipartite signed graphs ⋮ Coefficients of non-negative quasi-Cartan matrices, their symmetrizers and Gram matrices ⋮ A computational technique in Coxeter spectral study of symmetrizable integer Cartan matrices ⋮ A Coxeter type classification of one-peak principal posets ⋮ Congruence of rational matrices defined by an integer matrix

Uses Software

• Maple
• Python

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Gram classification of non-negative corank-two loop-free edge-bipartite graphs
• Structure and a Coxeter-Dynkin type classification of corank two non-negative posets.
• Inflation algorithm for loop-free non-negative edge-bipartite graphs of corank at least two
• \(P\)-critical integral quadratic forms and positive unit forms: an algorithmic approach
• Mesh geometries of root orbits of integral quadratic forms
• On computing the determinant in small parallel time using a small number of processors
• On weakly positive unit forms
• A characterization of positive unit forms
• Canonical matrices for linear matrix problems
• A Gram classification of principal Cox-regular edge-bipartite graphs via inflation algorithm
• Graphical characterization of positive definite non symmetric quasi-Cartan matrices
• Quadratic forms. Combinatorics and numerical results
• A Coxeter spectral classification of positive edge-bipartite graphs. I: Dynkin types \(\mathcal{B}_n\), \(\mathcal{C}_n\), \(\mathcal{F}_4\), \(\mathcal{G}_2\), \(\mathbb{E}_6\), \(\mathbb{E}_7\), \(\mathbb{E}_8\)
• Complexity of matrix problems
• Congruences of a square matrix and its transpose
• A framework for Coxeter spectral classification of finite posets and their mesh geometries of roots.
• The Dynkin type of a non-negative unit form.
• On Coxeter type study of non-negative posets using matrix morsifications and isotropy groups of Dynkin and Euclidean diagrams.
• Mesh Algorithms for Coxeter Spectral Classification of Cox-regular Edge-bipartite Graphs with Loops, I. Mesh Root Systems
• On Algorithmic Study of Non-negative Posets of Corank at Most Two and their Coxeter-Dynkin Types
• A Coxeter--Gram Classification of Positive Simply Laced Edge-Bipartite Graphs
• Mesh Algorithms for Solving Principal Diophantine Equations, Sand-glass Tubes and Tori of Roots
• Graph Theoretical and Algorithmic Characterizations of Positive Definite Symmetric Quasi-Cartan Matrices
• Numeric Algorithms for Corank Two Edge-bipartite Graphs and their Mesh Geometries of Roots
• Inflation Agorithm for Cox-regular Postive Edge-bipartite Graphs with Loops
• Cubic Algorithm to Compute the Dynkin Type of a Positive Definite Quasi-Cartan Matrix
• Congruences of Edge-bipartite Graphs with Applications to Grothendieck Group Recognition I. Inflation Algorithm Revisited*
• Congruences of Edge-bipartite Graphs with Applications to Grothendieck Group Recognition II. Coxeter Type Study*
• Symbolic Algorithms Computing Gram Congruences in the Coxeter Spectral Classification of Edge-bipartite Graphs, I. A Gram Classification
• Symbolic Algorithms Computing Gram Congruences in the Coxeter Spectral Classification of Edge-bipartite Graphs, II. Isotropy Mini-groups
• A characterization of positive unit forms. II

This page was built for publication: On the structure of loop-free non-negative edge-bipartite graphs