Covering graph conjecture for 2-token graphs of stars
Statement
Let be the star graph with leaves. Suppose that divides . A combined voltage assignment on a base graph with values in the group defines a covering graph .
Covering conjecture for 2-token star graphs. The token graph is isomorphic to a covering graph of a base graph on vertices, with combined assignment on the group .
The conjecture summarizes the preceding examples and discussion for 2-token graphs of stars; no resolution is supplied in the source.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.