Abstract
We continue the Coxeter spectral study of finite connected loop-free edge-bipartite graphs ?, with n ? 2 vertices (a class of signed graphs), started in [SIAM J. Discrete Math., 27(2013), 827-854] by means of the complex Coxeter spectrum specc? C. Here, we discuss Coxeter spectral analysis problems of non-negative edge-bipartite graphs of corank s ? n -- 1, which means that the symmetric Gram matrix G? ? Mn (Z) is positive semi-definite of rank n -- s ? n. In particular, we study in details the loop-free edge-bipartite graphs of corank s = n -- 1. We present algorithms that generate all such edge-bipartite graphs of a given size, using symbolic and numerical computer calculations in Python, and we obtain their complete classification in relation with Diophantine geometry problems. We also construct algorithms that allow us to classify all connected loop-free non-negative edge-bipartite graphs, with a fixed number of vertices, by means of their Coxeter spectra.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
