<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xml:lang="en"><front><journal-meta><journal-id journal-id-type="publisher-id">neicon</journal-id><journal-title-group><journal-title xml:lang="en">Scholarly Research and Information</journal-title><trans-title-group xml:lang="ru"><trans-title>Наука и научная информация</trans-title></trans-title-group></journal-title-group><issn pub-type="epub">2658-3143</issn><publisher><publisher-name>NP «NEICON»</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.24108/2658-3143-2021-4-1-2-19-28</article-id><article-id custom-type="elpub" pub-id-type="custom">neicon-112</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="en"><subject>SCHOLARLY INFORMATION AND RESEARCH MANAGEMENT</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>ИНФОРМАЦИОННОЕ ОБЕСПЕЧЕНИЕ И УПРАВЛЕНИЕ НАУЧНЫМИ ИССЛЕДОВАНИЯМИ</subject></subj-group></article-categories><title-group><article-title>On relations in science: the case of the scientific journal editorial board</article-title><trans-title-group xml:lang="ru"><trans-title>О связях в науке на примере редакционной коллегии научного журнала</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0001-7694-1454</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Большаков</surname><given-names>Д. Ю.</given-names></name><name name-style="western" xml:lang="en"><surname>Bolshakov</surname><given-names>D. Yu.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Денис Юрьевич Большаков, кандидат технических наук, начальник отдела научно-технических изданий и специальных проектов</p><p>ул. Верейская, 41, Москва, 121471</p></bio><bio xml:lang="en"><p>Denis Yu. Bolshakov, Candidate of Technical Sciences, Head of the Department of Scientific and Technical Publications and Special Projects of the Office of the Director General</p><p>Vereiskaya str., 41, Moscow, 121471</p></bio><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru">Акционерное общество «Концерн воздушно-космической обороны «Алмаз — Антей»<country>Россия</country></aff><aff xml:lang="en">«Almaz — Antey» Air and Space Defence Corporation, Joint Stock Company<country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2021</year></pub-date><pub-date pub-type="epub"><day>22</day><month>10</month><year>2021</year></pub-date><volume>4</volume><issue>1-2</issue><fpage>23</fpage><lpage>32</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Bolshakov D.Y., 2021</copyright-statement><copyright-year>2021</copyright-year><copyright-holder xml:lang="ru">Большаков Д.Ю.</copyright-holder><copyright-holder xml:lang="en">Bolshakov D.Y.</copyright-holder><license license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://05x01x01x01x02.ejs-01.elpub.dev/jour/article/view/112">https://05x01x01x01x02.ejs-01.elpub.dev/jour/article/view/112</self-uri><abstract><p>This article analyses the connections between members of the editorial board of a scientific journal which are formed based on their reviews of scientific articles. It is shown that the connections can be represented as a graph. The research uses the data for six years of article reviewing in the scientific and technical Journal of "Almaz — Antey" Air and Space Defence Corporation.</p><p>The methods of analysis are combinatorics and graph theory, as well as the relevant graph characteristics: adjacency matrix, incidence matrix, reachability matrix, graph fullness and connectivity, nearest neighbours graph and graph spanning tree.</p><p>It is shown that cooperation of the reviewers of the Journal helps plot a connected graph with links between any two vertices, i.e. between any reviewers.</p><p>The graph is analysed and the methods of its application to calculate the Journal’s scientometric indicators are demonstrated. As the research reveals, a journal that publishes articles in numerous disciplines forms connections between all reviewers and this parameter can be indicative of interchangeability within the scientific fields or, conversely, of a joint work in this scientific field when reviewing manuscripts. Based on the research results, it is possible to search for new reviewers in the areas where competencies are underdeveloped. And by the areas where competencies are strong, we can determine the core competence of the reviewers of a scientific journal, reflecting the main focus of the evaluated scientific research.</p><p>The work resulted in the formulated scientometric indicators of the journal, which can be used to search for and involve new reviewers or to represent data on a strong team of reviewers on a specific topic, as well as on a new scientific field just emerging for research.</p></abstract><trans-abstract xml:lang="ru"><p>Анализируются связи между рецензентами научно-технического журнала, формируемые на основании подготовленных ими рецензий. Показано, что связи могут быть представлены в виде графа.</p><p>Для проведения исследования используются данные о рецензировании статей в научно-техническом журнале «Вестник Концерна ВКО «Алмаз — Антей» за шесть лет. Методами анализа являются комбинаторика и теория графов и связанные с ними вычисляемые характеристики графов: матрицы смежности, инцидентности, достижимости, полнота и связность графа, граф ближних соседей и связующее дерево графа. Показано, что сотрудничество рецензентов для рассматриваемого журнала формирует связный граф, в котором существует путь между любыми двумя вершинами, то есть любыми рецензентами. Проведен анализ графа, и показаны способы его использования для расчёта наукометрических показателей журнала.</p><p>В результате исследования выявлено, что у журнала, публикующего статьи по различным специальностям, формируются связи между всеми рецензентами. По данному параметру можно говорить о взаимозаменяемости в рамках научных направлений или, наоборот, о совместной работе в определенном научном направлении при рецензировании рукописей. По результатам исследования можно организовывать поиск новых рецензентов в областях, где компетенции недостаточно развиты, а по областям, где компетенции сильны, можно судить об основной компетенции рецензентов научного журнала, которая отражает основную направленность оцениваемых научных исследований.</p><p>Итогом работы являются сформулированные наукометрические показатели журнала, которые могут быть использованы для поиска и привлечения новых рецензентов или отражения данных о высокопрофессиональных рецензентах в определенной тематике, а также о наличии нового научного направления, которое только начинает развиваться.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>граф связей рецензентов</kwd><kwd>научные направления издания</kwd><kwd>полный граф</kwd><kwd>связанный граф</kwd><kwd>рецензент</kwd><kwd>научно-технический журнал</kwd></kwd-group><kwd-group xml:lang="en"><kwd>reviewers connection graph</kwd><kwd>scientific fields of publication</kwd><kwd>full graph</kwd><kwd>connected graph</kwd><kwd>reviewer</kwd><kwd>scientific and technical journal</kwd></kwd-group></article-meta></front><body><sec><title>Introduction</title><p>So far, publication citations are supposed to be the basic criterion for estimating connections in science. However, such connections can be established between scientists in the course of expert review of manuscripts prior to publication in a scientific journal. Reviewing research papers helps establish the connections between scientists both from allied sciences and from absolutely different fields. This is an indirect proof of certain connections between different branches of science.</p><p>Moreover, scientific connections being established between reviewers allow to understand the research fields of a particular scientific journal and analyse scientific disciplines where reviewers can replace one another in validation of manuscripts.</p><p>We should note that some research papers are not published in the journal, because certain percentage of manuscripts is rejected or returned for revision. However, within a journal, connections between scientists are also established through co-reviewing of an unpublished manuscript. This allows to evaluate the science from the other side — it is not a research itself that is analysed, but review of the research papers that are not published. Further, this paper is not intended to draw a line between a published or unpublished manuscript. The goal is to analyse relevant connections formed between scientists.</p><p>Researchers have already applied the methods described herein and related to the graph theory in order to analyse a science and its allied fields [1–8]. For example, an analysis of reviewer’s work in editorial boards of several scientific journals and reviewer’s connections with research activities at a higher education institution are described in [<xref ref-type="bibr" rid="cit1">1</xref>]. The graph theory along with the graph connectivity used in this research is employed to identify relations in conflict resolution studies [<xref ref-type="bibr" rid="cit2">2</xref>]. The graph theory is proposed for visualization in the cognitive science [<xref ref-type="bibr" rid="cit3">3</xref>]; research papers [<xref ref-type="bibr" rid="cit4">4</xref>][<xref ref-type="bibr" rid="cit5">5</xref>] describe the potential of the graph theory in information visualization. An overview of papers devoted to the scientometric research of editorial boards of scientific journals is given in [<xref ref-type="bibr" rid="cit6">6</xref>]. A study in the field near to this research is given in [<xref ref-type="bibr" rid="cit7">7</xref>], devoted to a graph theory-based analysis of the network of scientific journals and scientists, as well as the relevant united groups. Paper [<xref ref-type="bibr" rid="cit8">8</xref>] analyses the influence of academic journals and their editorial boards on research fields and describes the formation of a social network consisting of interconnected editorial boards of scientific journals.</p></sec><sec><title>A graph theory-based analysis of connections between reviewers</title><p>Table 1 shows the frequency of assignment of a particular number of reviewers to articles submitted to the scientific and technical Journal of “Almaz — Antey” Air and Space Defence Corporation for the period of 2015–2021. The reference year is 2015, because since the second half of that year the journal’s policy was changed to send an article to more than one reviewer.</p><table-wrap id="table-1"><caption><p>Table 1. Frequency of assigning the number of reviewers to articles by year</p></caption><table><tbody><tr><td>Number of reviewers (reviews) for articles</td><td>Year</td></tr><tr><td>2015</td><td>2016</td><td>2017</td><td>2018</td><td>2019</td><td>2020</td><td>2021*</td></tr><tr><td>0</td><td>6</td><td>2</td><td>1</td><td>11</td><td>2</td><td>8</td><td>5</td></tr><tr><td>1</td><td>53</td><td>33</td><td>84</td><td>36</td><td>41</td><td>24</td><td>10</td></tr><tr><td>2</td><td>5</td><td>22</td><td>22</td><td>25</td><td>38</td><td>35</td><td>16</td></tr><tr><td>3</td><td>1</td><td>8</td><td>11</td><td>16</td><td>27</td><td>17</td><td>12</td></tr><tr><td>4</td><td>1</td><td>5</td><td>4</td><td>10</td><td>9</td><td>7</td><td>6</td></tr><tr><td>5</td><td>1</td><td>1</td><td>3</td><td>3</td><td>1</td><td>1</td><td>1</td></tr><tr><td>6</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td><td>—</td></tr><tr><td>7</td><td>—</td><td>—</td><td>—</td><td>—</td><td>1</td><td>1</td><td>1</td></tr><tr><td>8</td><td>—</td><td>—</td><td>—</td><td>1</td><td>—</td><td>—</td><td>—</td></tr><tr><td>Average number of reviewers per article</td><td>1,1</td><td>1,8</td><td>1,5</td><td>1,9</td><td>2,1</td><td>2,0</td><td>2,2</td></tr></tbody></table></table-wrap><p>As shown in Table 1, the maximum number of reviews distributed from one to two and more reviewers was shifted within the period of 2019 to 2020. This tendency continues in 2021.</p><p>It should be noted that articles that have failed to pass the check by the Antiplagiat plagiarism detection system are returned to authors unreviewed, with no reviewer assigned (number of reviews is 0).</p><p>Moreover, articles that do not meet the journal’s requirements to documentation execution or those of a very low scientific value are rejected and returned to authors. In this case, only one reviewer is assigned (1 review per article). As stated in [<xref ref-type="bibr" rid="cit9">9</xref>], conversion of articles, i.e. the ratio between the number of articles accepted for publications and the total number of submitted articles is a random value with normal distribution, which can be substituted with an average value equal to 0.4 (or 40 %) for the scientific and technical Journal of “Almaz — Antey” Air and Space Defence Corporation. In other words, one reviewer can be assigned to review 60 % of submitted articles, the quality of which fails to comply with the publication requirements.</p><p>A graph is plotted based on the relations forming between two and more reviewers working on an article [<xref ref-type="bibr" rid="cit10">10</xref>].</p><p>This graph is plotted as follows. Assume that a journal contains only two articles, and three reviewers are assigned to review one of them (Reviewer 1, Reviewer 2, and Reviewer 3), while two reviewers are assigned to review the other one (Reviewer 3 and Reviewer 4). After all the reviewers issue their conclusions of the first paper, links between reviewers will be established in relation to this paper as shown in the left part of Fig. 1. As for the second article, links are established in the right part of the graph between Reviewer 3 and Reviewer 4 after reviewers draw their conclusions. However, Reviewer 3 has connections with Reviewer 1 and Reviewer 2, while Reviewer 4 has no such links.</p><fig id="fig-1"><caption><p>Fig. 1. An example of constructing a graph of reviewers relations</p></caption><graphic xlink:href="neicon-4-1-2-g001.png"><uri content-type="original_file">https://cdn.elpub.ru/assets/journals/neicon/2021/1-2/mbO8zwmXA9Ww0OyKVrVtaOKeOib4NYFIdpLtxuLl.png</uri></graphic></fig><p>We should note that the reviewing routine process at the scientific and technical Journal of “Almaz — Antey” Air and Space Defence Corporation includes a smooth-running review exchange between experts involved in manuscript evaluation, but only after they present their expert opinions. Besides, journal articles cover different areas of science and engineering such as automation, aerodynamics, hydraulics, gas and fluid dynamics, mechanics, radio location, radio navigation, radio electronics, radio engineering, power electronics, thermal physics, chemical technologies, electric engineering, and electrodynamics. The journal’s editorial board includes many researchers studying not only their own field, but a few allied sciences (for instance, automation and hydraulics, aerodynamics and thermal physics, etc.).</p><p>If there is a single reviewer, he or she is not considered in graph plotting; if there are two and more reviewers, they are considered in plotting the connection with the number of possible combinations taken into account as well. For example, with three reviewers (1, 2, 3), all possible link combinations are considered (1-2, 2-3, 3-1). Directions are not considered, i.e. link 1-2 is identical to link 2-1. The number of combinations Сn² is calculated by the known formula [<xref ref-type="bibr" rid="cit11">11</xref>][<xref ref-type="bibr" rid="cit12">12</xref>]</p><p>(1)</p><p>The total number of combinations calculated by formula (1) is given in Table 2.</p><table-wrap id="table-2"><caption><p>Table 2. The number of relations of reviewers from their number</p></caption><table><tbody><tr><td>Parameter</td><td>Meaning</td></tr><tr><td>Number of reviewers per article</td><td>2</td><td>3</td><td>4</td><td>5</td><td>6</td><td>7</td><td>8</td></tr><tr><td>Number of combinations (relations)</td><td>1</td><td>3</td><td>6</td><td>10</td><td>15</td><td>21</td><td>28</td></tr></tbody></table></table-wrap></sec><sec><title>Research results</title><p>As a result, with 117 reviewers for the scientific and technical Journal of “Almaz — Antey” Air and Space Defence Corporation taken for research, 503 unique links have been identified (910 links result from 318 records of reviews made by several reviewers). Fig. 2 illustrates the graph linking 117 reviewers via 503 unique link combinations. The graph is plotted using the Graph[] function in the Wolfram Mathematica, a computer algebra system. Graph visualization is made with the help of the GraphPlot[] function, links between reviewers are identified using the Ksubsets[] function that generates combinations from a data array. The graph shown in Fig. 2 is modified in the graphic editor Adobe Illustrator in order to adjust its sizes and improve visualization. To see the detailed study, click the following link to an online platform <ext-link xlink:href="https://www.wolframcloud.com/env/3f0eb203-a684-4122-8554-b7a24dbdc986" ext-link-type="uri">https://www.wolframcloud.com/env/3f0eb203-a684-4122-8554-b7a24dbdc986</ext-link> or use a QR code below.</p><fig id="fig-2"><caption><p>Fig. 2. Graph of relations within the editorial board of the scientific Journal of “Almaz — Antey” Air and Space Defence Corporation</p></caption><graphic xlink:href="neicon-4-1-2-g002.png"><uri content-type="original_file">https://cdn.elpub.ru/assets/journals/neicon/2021/1-2/OpjfuRen5AdUDZUNrrrFwKveeZ5gt9xSlcUI6ykQ.png</uri></graphic></fig><p>Red colour indicates those reviewers who no longer cooperate with the journal’s editorial board for some reasons. For example, Reviewer 90 died, Reviewer 81 was unable to cooperate due to lack of time, being involved in other projects, and asked not to send manuscripts for reviewing. The graph is plotted with no consideration given to those reviewers who did not participate in reviewing of submitted articles.</p><p>The graph shown in Fig. 2 allows:</p><p>We should note that the full graph illustrates an ideal case — all reviewers are interconnected. For the case with 117 reviewers, the graph has 6,786 edges (formula n(n–1)/2) or connections between reviewers [<xref ref-type="bibr" rid="cit11">11</xref>][<xref ref-type="bibr" rid="cit12">12</xref>]. This means that all reviewers are absolutely interchangeable. In fact, it is possible only if a journal focuses on very special disciplines, for example, on publications related to a single discipline as per the HAC list. If a graph plotted on the basis of reviews received from reviewers is not connected and has two or more no longer connected sets of vertices and edges, such a journal can be classified as an interdisciplinary journal (for example, philology and biophysics). However, even for a multidisciplinary journal, with disjoint graphs illustrating connections between members of the editorial boards, relations between these connections and the connected graph can be established in order to determine the reviewers’ interchangeability depending on the direction.</p><p>Another graph (Fig. 3) is plotted based on the analysis of the adjacency matrix. The graph analyses the length of connections between reviewers. Since this graph is a connected one, there is a path between any two vertices.</p><fig id="fig-3"><caption><p>Fig. 3. The number of path lengths between vertices in the graph (between reviewers) along the ordinate axis and the path length along the abscissa axis</p></caption><graphic xlink:href="neicon-4-1-2-g003.png"><uri content-type="original_file">https://cdn.elpub.ru/assets/journals/neicon/2021/1-2/ufnnGRvNltD2DgHX4dtRhZezLzkWHQ9fh4lcwRD1.png</uri></graphic></fig><p>As shown in Fig. 3, the total amount of the longest paths between the members of the editorial board is not greater than 6. This is a proof of the six degrees of separation theory, which states that everyone in the world is connected by just six acquaintances [<xref ref-type="bibr" rid="cit13">13</xref>]. The zero path length corresponds to the number of graph vertices, i.e. to the number of reviewers, and is equal to 117 as expected. We should emphasize again that the resulting graph for the journal under consideration is a connected graph with all the vertices connected with one another. The path length indicates the closeness of research activities within an organization and the connectivity of research findings.</p><p>The number of connections between reviewers and their colleagues can be calculated by plotting a spanning tree based on the nearest neighbors’ graph, starting from the vertex with a certain reviewer number, as shown in Fig. 4 for Reviewer 32 (“Thermal physics”).</p><fig id="fig-4"><caption><p>(а)(b)</p><p>Fig. 4. The nearest neighbor graph for reviewer No. 32 (a) and the construction of a spanning tree on its basis (b)</p></caption><graphic xlink:href="neicon-4-1-2-g004.png"><uri content-type="original_file">https://cdn.elpub.ru/assets/journals/neicon/2021/1-2/44bDVmgelyUmtQqkVYFHwihwXKUXBanvHCxYlOaq.png</uri></graphic></fig><p>Plotting a spanning tree based on the nearest neighbours graph (a connected acyclic graph with the number of vertices similar to that of the initial graph with the number of edges equal to the number of vertices reduced by one, with the central vertex degree equal to the number of edges, and with the degree of other vertices equal to one; the incidence matrix of such a graph contains unities in the row with the central vertex, unities in the column of edges incident to a given vertex, and zeros in all other elements of the incidence matrix) allows to estimate the number of reviewer’s connections with other reviewers [<xref ref-type="bibr" rid="cit10">10</xref>]. As shown in Fig. 4b, it is easy to calculate the number of connections of Reviewer 32, which is equal to 13. Fig. 5 shows the number of connections for all 117 reviewers calculated as demonstrated above.</p><fig id="fig-5"><caption><p>Fig. 5. The number of connections of reviewers along the abscissa axis and the frequency of occurrence of this event along the ordinate axis</p></caption><graphic xlink:href="neicon-4-1-2-g005.png"><uri content-type="original_file">https://cdn.elpub.ru/assets/journals/neicon/2021/1-2/7OSQpjNixljzxJpIU495aJLyFiB0IhTHD7P5T5OJ.png</uri></graphic></fig></sec><sec><title>Discussion of results</title><p>As shown in Fig. 5, the maximum number of connections between reviewers is 1–5 with further decrease. The more connections a reviewer has with other reviewers within the editorial board, the higher the reviewer’s competence in reviewing manuscripts related to the specific research area or to allied sciences. It should be noted that a reviewer making poor-quality reviews is removed from the editorial board of the scientific and technical Special Journal of “Almaz — Antey” Air and Space Defence Corporation.</p><p>Those reviewers who are located beyond the centre of the graph and have a small number of connections with other reviewers, can belong to three types:</p><p>For example, assume that the journal under consideration publishes articles related to the only discipline — “Electronics. Radio Engineering”. In this case, the graph contains only those reviewers who review articles related to the specified subject (Reviewers 6, 8, 14, 17, 20, 21, 54, 71, 79, 80, 81, 90, 100, 103, 107). Except the connections with other reviewers, calculation of the number of connections between them (Fig. 6a) in relation to the number of edges of the full graph gives the value equal to 0.61 (64/105). This number is less than one, but the author supposes that such a result is obtained due to a short observation time: to form interconnections of all reviewers related to subject “Electronics. Radio Engineering”, in case of 15 reviewers, at least 105 articles shall be reviewed.</p><p>Reviewers specialising in subject “Gas Dynamics” (Reviewers 25, 74, 60) form three connections with one another, as clearly shown in Fig. 6b: the ratio between the number of the connections and the number of edges of the full graph for three vertices gives the exact value equal to 1.</p><fig id="fig-6"><caption><p>а)(b)</p><p>Fig. 6. Reviewers in the direction of “Electronics. Radio Engineering” (a) and “Gasdynamics” (b) and their connections</p></caption><graphic xlink:href="neicon-4-1-2-g006.png"><uri content-type="original_file">https://cdn.elpub.ru/assets/journals/neicon/2021/1-2/mhmMz4dFHT6RXAVdUaketeLD8Ich43IMhgEUOeA5.png</uri></graphic></fig><p>Data given in Table 2 can be used as follows: if a journal publishes articles related to several disciplines and its reviewers are not connected in terms of the discipline to be covered, it is reasonable to divide a journal in two or more, provided that articles related to each separated discipline are submitted on a regular basis.</p><p>For a limited-field journal, there are connections between all reviewers within the limit, because reviewers have competences to review any material to be published. The connection indicator can be viewed as an indirect estimate of a reviewer and the journal’s editorial board: materials related to a certain subject area are to be reviewed by more than one reviewer. This approach allows to shape different opinions on the materials to be published, because each reviewer has their own opinion regarding this or that research area.</p><p>Anyway, materials to be reviewed shall be sent to several reviewers. This works both for multidisciplinary and for limited-field journals. The experience gained by the staff of the scientific and technical Journal of “Almaz — Antey” Air and Space Defence Corporation proves that article processing involving more than two reviewers helps improve a manuscript.</p><p>Therefore, the ratio between the number of edges of the reviewers connections’ graph and the number of edges of the full graph with the same number of vertices, the value of which in the limit is equal to one, is the scientometric indicator. For a multidisciplinary journal, the scientometric indicator is the existence of two or more disconnected graphs of connections between reviewers, but within each graph its number of connection in the limit tends to the indicators of a limited-field journal. The scientometric indicator equal to one as well as other indicators (impact factor, Gini index, etc.) can be used as a reference mark for the editorial board of a limited-field journal. For the editorial board, this parameter indicates that all reviewers shall take part in the expert review process, while the limit indicator requires that the number of reviewers per particle shall be at least two, and reviewers shall be rotated from one article to another.</p></sec><sec><title>Conclusions</title></sec></body><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Крылова О.С., Крылов Д.А. Работа в редколлегии научного журнала как показатель профессиональной компетентности преподавателя вуза. Вестник Марийского государственного университета. 2018;12(4):44–50. https://doi.org/10.30914/2072-6783-2018-12-4-44-50</mixed-citation><mixed-citation xml:lang="en">Krylova O.S., Krylov D.A. Work in the editorial board of a scientific journal as an indicator of the professional competence of a university teacher. Vestnik Mariiskogo gosudarstvennogo universiteta = Vestnik of the Mari State University. 2018;12(4): 44–50 (In Russ.). https://doi.org/10.30914/2072-6783-2018-12- 4-44-50 (In Russ.).</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Путькина Л.В., Седов Р.Л. О приложениях теории графов в конфликтологии: опыт гуманитарного вуза. ЦИТИСЭ. 2019;(1):15.</mixed-citation><mixed-citation xml:lang="en">Putkina L.V., Sedov R.L. On the applications of the theory of graphs in conflictology: the experience of the humanitarian university. CITISE. 2019;(1):15 (In Russ.).</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Морозова О.А. Структурное сетевое моделирование в когнитивной науке. Психологические исследования [Интернет]. 2017;10(55): 1. Режим доступа: http://psystudy.ru/index.php/num/2017v10n55/1474-morozova55.html</mixed-citation><mixed-citation xml:lang="en">Morozova O.A. Structural network modelling in cognitive science. Psikhologicheskie issledovaniya = Psychological Studies [Internet]. 2017;10(55):1. Available at: http://psystudy.ru/index.php/num/2017v10n55/1474-morozova55.html (In Russ.).</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Апанович З.В. От рисования графов к визуализации информации. Препринт. Новосибирск: Российская академия наук Сибирское отделение Институт систем информатики им. А. П. Ершова; 2007. 28 с.</mixed-citation><mixed-citation xml:lang="en">Apanovich Z. V. From Graph Drawing Towards Information Visualization. Preprint Novosibirsk: Siberian Division of the Russian Academy of Sciences A.P. Ershov Institute of Informatics Systems; 2007. 28 p. (In Russ.).</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Целых А.А., Целых А.Н., Матвеев Д.А. Методы и средства визуализации массивов научно-технических показателей в виде графов. Современные проблемы науки и образования [Интернет]. 2013;(3):202–203. Режим доступа: https://science-engineering.ru/ru/article/view?id=687</mixed-citation><mixed-citation xml:lang="en">Tselykh A.A., Tselykh A.N., Matveev D.A. Methods and techniques for visualizing arrays of scientific and technical indicators using graphs. Sovremennye problemy nauki i obrazovaniya = Modern problems of science and education [Internet]. 2013;(3):69. Available at: https://science-engineering.ru/ru/article/view?id=687 (In Russ.).</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Mazov N.A., Gureev V.N. The editorial boards of scientific journals as a subject of scientometric research: A literature Review. Sci. Tech. Inf. Proc. 2016; 43(3):144–153. https://doi.org/10.3103/S0147688216030035</mixed-citation><mixed-citation xml:lang="en">Mazov N.A., Gureev V.N. The editorial boards of scientific journals as a subject of scientometric research: A literature Review. Sci. Tech. Inf. Proc. 2016; 43(3):144–153. https://doi.org/10.3103/S0147688216030035</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Goyanes M., de-Marcos L. Academic influence and invisible colleges through editorial board interlocking in communication sciences: a social network analysis of leading journals. Scientometrics. 2020;123(2):791–811. https://doi.org/10.1007/s11192-020-03401-z</mixed-citation><mixed-citation xml:lang="en">Goyanes M., de-Marcos L. Academic influence and invisible colleges through editorial board interlocking in communication sciences: a social network analysis of leading journals. Scientometrics. 2020;123(2):791–811. https://doi.org/10.1007/s11192-020-03401-z</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Teixeira E.K., Oliveira M. Editorial board interlocking in knowledge management and intellectual capital research field. Scientometrics. 2018;117(3):1853–1869. https://doi.org/10.1007/s11192-018-2937-x</mixed-citation><mixed-citation xml:lang="en">Teixeira E.K., Oliveira M. Editorial board interlocking in knowledge management and intellectual capital research field. Scientometrics. 2018;117(3):1853–1869. https://doi.org/10.1007/s11192-018-2937-x</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Большаков Д.Ю. Аналитика редакционно-издательских процессов научного журнала. Научный редактор и издатель. 2020;5(2):102–112. https://doi.org/10.24069/2542-0267-2020-2-102-112</mixed-citation><mixed-citation xml:lang="en">Bolshakov D.Yu. Analytics in the publishing of a scientific journal. Nauchnyi redactor i Izdatel’ = Science Editor and Publisher. 2020;5(2):102–112 (In Russ.). https://doi.org/10.24069/2542-0267-2020-2-102-112</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Deo N. Graph Theory with Applications to Engineering and Computer Science (Dover Books on Mathematics). Dover Publications; 2004. 498 p.</mixed-citation><mixed-citation xml:lang="en">Deo N. Graph Theory with Applications to Engineering and Computer Science (Dover Books on Mathematics). Dover Publications; 2004. 498 p.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Bender E.A. Williamson S.G. Foundations of Combinatorics with Applications. Dover Publications; 2006. 480 p.</mixed-citation><mixed-citation xml:lang="en">Bender E.A., Williamson S.G. Foundations of Combinatorics with Applications. Dover Publications; 2006. 480 p.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Gnedenko B.V. Theory of Probability. 6th ed. CRC Press; 2020. 520 p.</mixed-citation><mixed-citation xml:lang="en">Gnedenko B.V. Theory of Probability. 6th ed. CRC Press; 2020. 520 p.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Tadimety P.R. (2015) Six Degrees of Separation. In: OSPF: A Network Routing Protocol. Apress, Berkeley, CA. https://doi.org/10.1007/978-1-4842- 1410-7_1</mixed-citation><mixed-citation xml:lang="en">Tadimety P.R. (2015) Six Degrees of Separation. In: OSPF: A Network Routing Protocol. Apress, Berkeley, CA. https://doi.org/10.1007/978-1-4842- 1410-7_1</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
