Circulant graph conjecture for monophonic position number two
Statement
Let be an integer, and let a circulant graph mean a graph whose vertices are arranged cyclically with adjacency determined by a fixed set of cyclic differences. The monophonic position number is denoted by , and the diameter by . Circulant graph conjecture. For any , there is a circulant graph with order , monophonic position number , and diameter . The preceding theorem establishes existence of some graph with these parameters if and only if or ; the conjecture strengthens the large-order existence assertion by requiring the graph to be circulant, based on computational evidence.
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.