On the structure of loop-free non-negative edge-bipartite graphs (Q2272490): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 13:27, 31 July 2024

scientific article

Language	Label	Description	Also known as
English	On the structure of loop-free non-negative edge-bipartite graphs	scientific article

Statements

scholarly article

0 references

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

0 references

Katarzyna Zając

0 references

Linear Algebra and its Applications

0 references

publication date

10 September 2019

0 references

zbMATH Keywords

signed graph

0 references

edge-bipartite graph

0 references

Gram matrix

0 references

Euclidean diagram

0 references

Coxeter matrix

0 references

Coxeter spectrum

0 references

describes a project that uses

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.laa.2019.06.002

0 references

Graph Theoretical and Algorithmic Characterizations of Positive Definite Symmetric Quasi-Cartan Matrices

0 references

0 references

A characterization of positive unit forms

0 references

A characterization of positive unit forms. II

0 references

The Dynkin type of a non-negative unit form.

0 references

Quadratic forms. Combinatorics and numerical results

0 references

Complexity of matrix problems

0 references

On computing the determinant in small parallel time using a small number of processors

0 references

On Algorithmic Study of Non-negative Posets of Corank at Most Two and their Coxeter-Dynkin Types

0 references

0 references

On Coxeter type study of non-negative posets using matrix morsifications and isotropy groups of Dynkin and Euclidean diagrams.

0 references

Structure and a Coxeter-Dynkin type classification of corank two non-negative posets.

0 references

A Gram classification of non-negative corank-two loop-free edge-bipartite graphs

0 references

Congruences of a square matrix and its transpose

0 references

On weakly positive unit forms

0 references

Mesh Algorithms for Coxeter Spectral Classification of Cox-regular Edge-bipartite Graphs with Loops, I. Mesh Root Systems

0 references

0 references

A Gram classification of principal Cox-regular edge-bipartite graphs via inflation algorithm

0 references

Inflation Agorithm for Cox-regular Postive Edge-bipartite Graphs with Loops

0 references

\(P\)-critical integral quadratic forms and positive unit forms: an algorithmic approach

0 references

Congruences of Edge-bipartite Graphs with Applications to Grothendieck Group Recognition I. Inflation Algorithm Revisited*

0 references

Congruences of Edge-bipartite Graphs with Applications to Grothendieck Group Recognition II. Coxeter Type Study*

0 references

Cubic Algorithm to Compute the Dynkin Type of a Positive Definite Quasi-Cartan Matrix

0 references

Graphical characterization of positive definite non symmetric quasi-Cartan matrices

0 references

0 references

Canonical matrices for linear matrix problems

0 references

Mesh Algorithms for Solving Principal Diophantine Equations, Sand-glass Tubes and Tori of Roots

0 references

Mesh geometries of root orbits of integral quadratic forms

0 references

A Coxeter--Gram Classification of Positive Simply Laced Edge-Bipartite Graphs

0 references

Symbolic Algorithms Computing Gram Congruences in the Coxeter Spectral Classification of Edge-bipartite Graphs, I. A Gram Classification

0 references

Symbolic Algorithms Computing Gram Congruences in the Coxeter Spectral Classification of Edge-bipartite Graphs, II. Isotropy Mini-groups

0 references

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\)

0 references

A framework for Coxeter spectral classification of finite posets and their mesh geometries of roots.

0 references

Inflation algorithm for loop-free non-negative edge-bipartite graphs of corank at least two

0 references

Numeric Algorithms for Corank Two Edge-bipartite Graphs and their Mesh Geometries of Roots

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/j.laa.2019.06.002

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2272490

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2272490&oldid=37491074"