Código QR

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...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Abrosimov, Mihail Borisovich, Лось, Илья Викторович, Kostin, Sergey Vyacheslavovich
Formato: Artigo
Lenguaje:Inglês
Publicado: Saratov State University 2021-05-01
Colección:Известия Саратовского университета. Новая серия: Математика. Механика. Информатика
Materias:
Acceso en línea:https://mmi.sgu.ru/sites/mmi.sgu.ru/files/text-pdf/2021/05/238-245abrosimov_et_al.pdf
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!