Search

Issue
Title
Authors
On Enumeration of Labeled Connected Bridgeless Graphs
Voblyi V.A.
Spanning forests and special numbers
Deza E.I.
Two combinatorial identities related to enumeration of graphs
Vobly V.A.
Enumeration of labeled Eulerian $3$-cacti
Voblyi V.A.
Asymptotical enumeration of some labeled geodetic graphs
Voblyi V.A.
On the maximal number of spanning trees in cacti with given order
Voblyi V.A., Kononenko D.A.
New identities from enumeration of graphs
Voblyi V.A.
Qualitative properties of solutions to fourth-order differential equations on graphs
Kudaev R.C., Urtaeva A.A.
Flows in networks with barrier reachability
Yerushalayim Y.M., Skorokhodov V.A., Rusakov V.A.
Enumeration of labeled thorn graphs
Voblyi V.A., Arkhipova N.A.
On asymptotics of solution of nonlinear difference equation of convolution type
Voblyi V.A.
Approximations of the percolation probability on a periodic graph $\mathbb{Z}^2$
Virchenko Y.P., Cherkashin D.A.
Combinatorial algorithm for finding the number of paths on a directed graph
Erusalimskiy l.M., Cherdyntseva M.I.
Extreme paths on graphs with simultaneously varying arc durations
Erusalimskiy Y.M., Osipov M.I., Skorokhodov V.A.
Hierarchical models in discrete percolation theory and Markov branching processes
Virchenko Y.P., Cherkashin D.A.
An efficient algorithm for finding final vertices in a generalized functional graph
Zubkov O.V.
Asymptotics of the independence number of a random subgraph of the graph G(n, r, < s)
Raigorodsky А.М.
Concise English-Russian dictionary on graph theory
Voblyi V.A., Arkhipova N.A.
On functioning of resource networks
Erusalimskiy I.M., Abdulrahman H.N., Skorokhodov V.A., Babintsev V.A.
Maximum flow in parallel networks with connected arcs
Yerusalimsky Y.M., Skorokhodov V.A., Rusakov V.A.
1 - 20 of 20 Items

Search tips:

  • Search terms are case-insensitive
  • Common words are ignored
  • By default only articles containing all terms in the query are returned (i.e., AND is implied)
  • Combine multiple words with OR to find articles containing either term; e.g., education OR research
  • Use parentheses to create more complex queries; e.g., archive ((journal OR conference) NOT theses)
  • Search for an exact phrase by putting it in quotes; e.g., "open access publishing"
  • Exclude a word by prefixing it with - or NOT; e.g. online -politics or online NOT politics
  • Use * in a term as a wildcard to match any sequence of characters; e.g., soci* morality would match documents containing "sociological" or "societal"

Согласие на обработку персональных данных

 

Используя сайт https://journals.rcsi.science, я (далее – «Пользователь» или «Субъект персональных данных») даю согласие на обработку персональных данных на этом сайте (текст Согласия) и на обработку персональных данных с помощью сервиса «Яндекс.Метрика» (текст Согласия).