|
Discrete mathematics and mathematical cybernetics
Small length circuits in Eulerian orientations of graphs
A. L. Perezhogina, I. S. Bykovb, S. V. Avgustinovicha a Sobolev Institute of Mathematics, pr. Koptyuga, 4, 630090, Novosibirsk, Russia
b Novosibirsk State University, Pirogova str., 1, 630090, Novosibirsk, Russia
Abstract:
In this paper we investigate estimates for number of 3-, 4- and 5-circuits in eulerian tournaments and 4-circuits in eulerian orientations of complete bipartite graphs and hypercubes. By using obtained relations, we prove uniqueness (up to isomorphism) of orientations, which reach maximum number of 4-circuits in all graph families mentioned above.
Keywords:
Eulerian orientation of graph, circuit, tournament, complete bipartite graph, boolean cube.
Received December 12, 2023, published June 6, 2024
Citation:
A. L. Perezhogin, I. S. Bykov, S. V. Avgustinovich, “Small length circuits in Eulerian orientations of graphs”, Sib. Èlektron. Mat. Izv., 21:1 (2024), 370–382
Linking options:
https://www.mathnet.ru/eng/semr1691 https://www.mathnet.ru/eng/semr/v21/i1/p370
|
Statistics & downloads: |
Abstract page: | 39 | Full-text PDF : | 15 |
|