A Gram classification of non-negative corank-two loop-free edge-bipartite graphs
详细信息    查看全文
文摘
We continue the Coxeter spectral study of finite connected loop-free edge-bipartite graphs Δ, with m+2≥3 vertices (a class of signed graphs), started in Simson (2013) [49], by means of the non-symmetric Gram matrix View the MathML source of Δ, its symmetric Gram matrix View the MathML source, the Gram quadratic form qΔ:Zm+2→Z, and the Coxeter spectrum speccΔ⊂C, i.e., the complex spectrum of the Coxeter matrix View the MathML source. In the present paper we study non-negative edge-bipartite graphs of corank two, in the sense that the symmetric Gram matrix GΔ∈Mm+2(Z) of Δ is positive semi-definite of rank m≥1. One of our aims is to get a complete classification of all connected corank-two loop-free edge-bipartite graphs Δ, with m+2≥3 vertices, up to the weak Gram Z-congruence 05c4899655b122390b5eb" title="Click to view the MathML source">Δ∼ZΔ, where 05c4899655b122390b5eb" title="Click to view the MathML source">Δ∼ZΔ means that GΔ=Btr⋅GΔ⋅B, for some B∈Mm+2(Z) such that det⁡B=±1. By one-vertex extensions of the simply laced Euclidean diagrams View the MathML source, m≥1, View the MathML source, m≥4, View the MathML source, we construct a family of connected loop-free corank-two diagrams View the MathML source (called simply extended Euclidean diagrams) such that they classify all connected corank-two loop-free edge-bipartite graphs Δ, with m+2≥3 vertices, up to the weak Gram Z-congruence 05c4899655b122390b5eb" title="Click to view the MathML source">Δ∼ZΔ. A structure of connected corank-two loop-free edge-bipartite graphs Δ is described. It is shown that every such Δ contains a connected positive edge-bipartite subgraph Δ, that is Z-congruent with a simply laced Dynkin diagram DynΔ (called the Dynkin type of Δ) such that Δ is a two-point extension Δ[[u,w]] of Δ along two roots u,w of the positive definite Gram form qΔ:Zm→Z. This yields a combinatorial algorithm ,u,w)↦Δ[[u,w]] allowing us to construct all connected corank-two loop-free edge-bipartite graphs Δ, with m+2≥3 vertices and c4012" title="Click to view the MathML source">D=DynΔ, from the triples ,u,w), where Δ is positive of the Dynkin type D  , and u,w are roots of the positive definite Gram form qΔ:Zm→Z.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700