About a criterion of equality to 3 for exponent of regular primitive graph
Prikladnaya Diskretnaya Matematika. Supplement, no. 12 (2019), pp. 182-185.

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

This paper presents some results related to finding criterion of equality to 3 for the exponent of regular primitive graph. Several necessary and several sufficient conditions are found. We show that no one of them could be criterion. For that purpose, we have also run a computation experiment for counting the number of primitive regular graphs with the exponent 3, that don't satisfied those conditions. As for a graph of the diameter 2, the following criterion is found for it: graph with diameter 2 is primitive with exponent 3 iff each vertex in that graph lies on at least one cycle of length 3 and there is at least one edge that does not lie on cycles with length 3.
Keywords: primitive graph, regular graph, graph exponent.
@article{PDMA_2019_12_a50,
     author = {I. V. Los' and M. B. Abrosimov},
     title = {About a criterion of equality to 3 for exponent of regular primitive graph},
     journal = {Prikladnaya Diskretnaya Matematika. Supplement},
     pages = {182--185},
     publisher = {mathdoc},
     number = {12},
     year = {2019},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDMA_2019_12_a50/}
}
TY  - JOUR
AU  - I. V. Los'
AU  - M. B. Abrosimov
TI  - About a criterion of equality to 3 for exponent of regular primitive graph
JO  - Prikladnaya Diskretnaya Matematika. Supplement
PY  - 2019
SP  - 182
EP  - 185
IS  - 12
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDMA_2019_12_a50/
LA  - ru
ID  - PDMA_2019_12_a50
ER  - 
%0 Journal Article
%A I. V. Los'
%A M. B. Abrosimov
%T About a criterion of equality to 3 for exponent of regular primitive graph
%J Prikladnaya Diskretnaya Matematika. Supplement
%D 2019
%P 182-185
%N 12
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDMA_2019_12_a50/
%G ru
%F PDMA_2019_12_a50
I. V. Los'; M. B. Abrosimov. About a criterion of equality to 3 for exponent of regular primitive graph. Prikladnaya Diskretnaya Matematika. Supplement, no. 12 (2019), pp. 182-185. http://geodesic.mathdoc.fr/item/PDMA_2019_12_a50/

[1] Jin M., Lee S. G., Seol H. G., “Exponents of $r$-regular primitive matrices”, Inform. Center Math. Sci., 6:2 (2003), 51–57

[2] Bueno M. I., Furtado S., “On the exponent of $r$-regular primitive matrices”, ELA. Electr. J. Linear Algebra, 17 (2008), 28–47 | MR | Zbl

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

[4] Los I. V., Abrosimov M. B., “K voprosu o maksimalnom chisle vershin v primitivnykh regulyarnykh grafakh s eksponentom 3”, Prikladnaya diskretnaya matematika. Prilozhenie, 2018, no. 11, 112–114

[5] Abrosimov M. B., Kostin S. V., “K voprosu o primitivnykh odnorodnykh grafakh s eksponentom, ravnym 2”, Prikladnaya diskretnaya matematika. Prilozhenie, 2017, no. 10, 131–134