Asymptotic behavior of the number of Eulerian orientations of graphs (Q358192): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(5 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Mikhail Isaev / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1110.2598 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The asymptotic numbers of regular tournaments, Eulerian digraphs and Eulerian oriented graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of Eulerian orientations of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Le Polynôme De Martin D'un Graphe Eulerien / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the number of Eulerian orientations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound for the number of Eulerian orientations of a regular graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5682350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873761 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic Enumeration of Eulerian Circuits in the Complete Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic behaviour of the number of Eulerian circuits / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1982715928 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:41, 30 July 2024

scientific article
Language Label Description Also known as
English
Asymptotic behavior of the number of Eulerian orientations of graphs
scientific article

    Statements

    Asymptotic behavior of the number of Eulerian orientations of graphs (English)
    0 references
    0 references
    16 August 2013
    0 references
    0 references
    simple graph
    0 references
    Eulerian orientation of a graph
    0 references
    algebraic connectivity
    0 references
    Laplacian matrix
    0 references
    matrix with diagonal dominance
    0 references
    spanning tree
    0 references
    conditioning of a matrix
    0 references
    0 references
    0 references