Standard

On Cayley representations of finite graphs over Abelian p-groups. / Ryabov, G.

In: St. Petersburg Mathematical Journal, Vol. 32, No. 1, 6, 2020, p. 71-89.

Research output: Contribution to journal › Article › peer-review

Harvard

Ryabov, G 2020, 'On Cayley representations of finite graphs over Abelian p-groups', St. Petersburg Mathematical Journal, vol. 32, no. 1, 6, pp. 71-89. https://doi.org/10.1090/spmj/1639

APA

Ryabov, G. (2020). On Cayley representations of finite graphs over Abelian p-groups. St. Petersburg Mathematical Journal, 32(1), 71-89. [6]. https://doi.org/10.1090/spmj/1639

Vancouver

Ryabov G. On Cayley representations of finite graphs over Abelian p-groups. St. Petersburg Mathematical Journal. 2020;32(1):71-89. 6. doi: 10.1090/spmj/1639

Author

Ryabov, G. / On Cayley representations of finite graphs over Abelian p-groups. In: St. Petersburg Mathematical Journal. 2020 ; Vol. 32, No. 1. pp. 71-89.

BibTeX

@article{babe4fd11186452fbe11e6ac4ccab2fa,
title = "On Cayley representations of finite graphs over Abelian p-groups",
abstract = "A polynomial-time algorithm is constructed that, given a graph Γ, finds the full set of nonequivalent Cayley representations of Γ over the group D ∼= Cp ×Cpk, where p ∈ {2, 3} and k ≥ 1. This result implies that the recognition and isomorphism problems for Cayley graphs over D can be solved in polynomial time.",
keywords = "Coherent configurations, Cayley graphs, Cayley graph isomorphism problem, ISOMORPHISM-PROBLEM",
author = "G. Ryabov",
note = "Funding Information: 2020 Mathematics Subject Classification. 05E30, 05C60, 20B35. Key words and phrases. Coherent configurations, Cayley graphs, Cayley graph isomorphism problem. The work was supported by the Russian Foundation for Basic Research (project 18-31-00051). Publisher Copyright: {\textcopyright} 2020. All Rights Reserved.",
year = "2020",
doi = "10.1090/spmj/1639",
language = "English",
volume = "32",
pages = "71--89",
journal = "St. Petersburg Mathematical Journal",
issn = "1061-0022",
publisher = "American Mathematical Society",
number = "1",

}

RIS

TY - JOUR

T1 - On Cayley representations of finite graphs over Abelian p-groups

AU - Ryabov, G.

N1 - Funding Information: 2020 Mathematics Subject Classification. 05E30, 05C60, 20B35. Key words and phrases. Coherent configurations, Cayley graphs, Cayley graph isomorphism problem. The work was supported by the Russian Foundation for Basic Research (project 18-31-00051). Publisher Copyright: © 2020. All Rights Reserved.

PY - 2020

Y1 - 2020

N2 - A polynomial-time algorithm is constructed that, given a graph Γ, finds the full set of nonequivalent Cayley representations of Γ over the group D ∼= Cp ×Cpk, where p ∈ {2, 3} and k ≥ 1. This result implies that the recognition and isomorphism problems for Cayley graphs over D can be solved in polynomial time.

AB - A polynomial-time algorithm is constructed that, given a graph Γ, finds the full set of nonequivalent Cayley representations of Γ over the group D ∼= Cp ×Cpk, where p ∈ {2, 3} and k ≥ 1. This result implies that the recognition and isomorphism problems for Cayley graphs over D can be solved in polynomial time.

KW - Coherent configurations

KW - Cayley graphs

KW - Cayley graph isomorphism problem

KW - ISOMORPHISM-PROBLEM

UR - http://www.scopus.com/inward/record.url?scp=85093806407&partnerID=8YFLogxK

UR - https://www.elibrary.ru/item.asp?id=45241075

U2 - 10.1090/spmj/1639

DO - 10.1090/spmj/1639

M3 - Article

VL - 32

SP - 71

EP - 89

JO - St. Petersburg Mathematical Journal

JF - St. Petersburg Mathematical Journal

SN - 1061-0022

IS - 1

M1 - 6

ER -

ID: 34748829