Abstract
The class of simple graphs with large algebraic connectivity (the second minimal eigenvalue of the Laplacian matrix) is considered. For graphs of this class, the asymptotic behavior of the number of Eulerian orientations is obtained. New properties of the Laplacian matrix are established, as well as an estimate of the conditioning of matrices with asymptotic diagonal dominance is obtained.
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.
