Abstract
It is proved that a graph on n nodes is k-connected if and only if its nodes can be represented by real vectors in dimension n – k such that (a) nonadjacent nodes are represented by orthogonal vectors and (b) any n – k of them are linearly independent. We show that the closure of the set of all representations with properties (a) and (b) is irreducible as an algebraic variety, and study the question of irreducibility of the variety of all representations with property (a).
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.
