Geodesic
The construction of all nonisomorphic minimum vertex extensions of the graph by the method of canonical representatives
Izvestiya of Saratov University. Mathematics. Mechanics. Informatics, Tome 21 (2021) no. 2, pp. 238-245 
M. B. Abrosimov; I. V. Los'; S. V. Kostin. The construction of all nonisomorphic minimum vertex extensions of the graph by the method of canonical representatives. Izvestiya of Saratov University. Mathematics. Mechanics. Informatics, Tome 21 (2021) no. 2, pp. 238-245. http://geodesic.mathdoc.fr/item/ISU_2021_21_2_a9/
@article{ISU_2021_21_2_a9,
     author = {M. B. Abrosimov and I. V. Los' and S. V. Kostin},
     title = {The construction of all nonisomorphic minimum vertex extensions of~the~graph by the method of canonical representatives},
     journal = {Izvestiya of Saratov University. Mathematics. Mechanics. Informatics},
     pages = {238--245},
     year = {2021},
     volume = {21},
     number = {2},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ISU_2021_21_2_a9/}
}
TY  - JOUR
AU  - M. B. Abrosimov
AU  - I. V. Los'
AU  - S. V. Kostin
TI  - The construction of all nonisomorphic minimum vertex extensions of the graph by the method of canonical representatives
JO  - Izvestiya of Saratov University. Mathematics. Mechanics. Informatics
PY  - 2021
SP  - 238
EP  - 245
VL  - 21
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/ISU_2021_21_2_a9/
LA  - ru
ID  - ISU_2021_21_2_a9
ER  - 
%0 Journal Article
%A M. B. Abrosimov
%A I. V. Los'
%A S. V. Kostin
%T The construction of all nonisomorphic minimum vertex extensions of the graph by the method of canonical representatives
%J Izvestiya of Saratov University. Mathematics. Mechanics. Informatics
%D 2021
%P 238-245
%V 21
%N 2
%U http://geodesic.mathdoc.fr/item/ISU_2021_21_2_a9/
%G ru
%F ISU_2021_21_2_a9

Voir la notice de l'article provenant de la source Math-Net.Ru

A graph $G = (V, \alpha)$ is called primitive if there exists a natural $k$ such that between any pair of vertices of the graph $G$ there is a route of length $k$. This paper considers undirected graphs with exponent 2. A criterion for the primitivity of a graph with the exponent 2 and a necessary condition are proved. A graph is primitive with the exponent 2 if and only if its diameter is 1 or 2, and each of its edges is included in a triangle. A computational experiment on the construction of all primitive homogeneous graphs with the number of vertices up to 16 and the exponent 2 is described, its results are analyzed. All homogeneous graphs of orders 2, 3, and 4, which are primitive with the exponent 2, are given, and for homogeneous graphs of order 5, the number of primitive graphs with the exponent 2 is determined.

[1] Frobenius F. G., Über Matrizen aus nicht negativen Elementen, Sitzungsberichte der Königlich Preussischen Akademie der Wissenschaften, Berlin, 1912, 22 pp. | Zbl

[2] Wielandt H., “Unzerlegbare, nicht negative Matrizen”, Mathematische Zeitschrift, 52 (1950), 642–648 | DOI | MR

[3] Fomichev V. M., Avezova Y. E., Koreneva A. M., Kyazhin S. N., “Primitivity and local primitivity of digraphs and nonnegative matrices”, Journal of Applied and Industrial Mathematics, 12:3 (2018), 453–469 | DOI | DOI | MR | Zbl

[4] Jin M., Lee S. G., Seol H. G., “Exponents of r-regular primitive matrices”, Information Center for Mathematical Sciences, 6:2 (2003), 51–57

[5] Bueno M. I., Furtado S., “On the exponent of R-regular primitive matrices”, ELA. The Electronic Journal of Linear Algebra, 17 (2008), 28–47 | DOI | MR | Zbl

[6] Kim B., Song B., Hwang W., “Nonnegative primitive matrices with exponent 2”, Linear Algebra and its Applications, 2005, no. 407, 162–168 | DOI | MR | Zbl

[7] Sachkov V. N., Oshkin I. B., “Exponents of classes of non-negative matrices”, Discrete Mathematics and Applications, 3:4 (1993), 365–375 | DOI | MR | Zbl

[8] Salii V. N., “Minimal primitive extensions of oriented graphs”, Prikladnaya Diskretnaya Matematika, 2008, no. 1 (1), 116–119 (in Russian) | Zbl

[9] Fomichev V. M., “The estimates of exponents for primitive graphs”, Prikladnaya Diskretnaya Matematika, 2011, no. 2 (12), 101–112 (in Russian) | Zbl

[10] Fomichev V. M., Avezova Y. E., “The exact formula for the exponents of the mixing digraphs of register transformations”, Journal of Applied and Industrial Mathematics, 14:2 (2020), 308–319 | DOI | DOI | MR

[11] Meringer M., “Fast generation of regular graphs and construction of cages”, Journal of Graph Theory, 30:2 (1999), 137–146 | 3.0.CO;2-G class='badge bg-secondary rounded-pill ref-badge extid-badge'>DOI | MR | Zbl

[12] Abrosimov M. B., Kostin S. V., “About primitive regular graphs with exponent 2”, Applied Discrete Mathematics. Supplement, 2017, no. 10, 131–134 (in Russian) | DOI

[13] Kostin S. V., “On the use of graph theory problems for the intellectual development of students”, Mathematics in Education, 2014, no. 10, 68–74 (in Russian)