The construction of all nonisomorphic minimum vertex extensions of the graph by the method of canonical representatives
A graph $G = (V, \alpha)$ is called \textit{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 ne...
I tiakina i:
| Ngā kaituhi matua: | , , |
|---|---|
| Hōputu: | Artigo |
| Reo: | Inglês |
| I whakaputaina: |
Saratov State University
2021-05-01
|
| Rangatū: | Известия Саратовского университета. Новая серия: Математика. Механика. Информатика |
| Ngā marau: | |
| Urunga tuihono: | https://mmi.sgu.ru/sites/mmi.sgu.ru/files/text-pdf/2021/05/238-245abrosimov_et_al.pdf |
| Ngā Tūtohu: |
Kāore He Tūtohu, Me noho koe te mea tuatahi ki te tūtohu i tēnei pūkete!
|