Asymptotic behavior of the number of Eulerian orientations of graphs

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

arXiv admin note: text overlap with arXiv:1104.3046

Scientific paper

We consider the class of simple graphs with large algebraic connectivity (the second-smallest eigenvalue of the Laplacian matrix). For this class of graphs we determine the asymptotic behavior of the number of Eulerian orientations. In addition, we establish some new properties of the Laplacian matrix, as well as an estimate of a conditionality of matrices with the asymptotic diagonal predominance

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Asymptotic behavior of the number of Eulerian orientations of graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Asymptotic behavior of the number of Eulerian orientations of graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Asymptotic behavior of the number of Eulerian orientations of graphs will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-633165

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.