Conjecture on highly valenced graphs with two main and two plain eigenvalues
Statement
Let be a connected -valenced graph, meaning that it has distinct valencies, with two main and two plain eigenvalues.
Valency conjecture. There exists a positive integer such that if , then is a strong graph.
This conjecture is posed as an analogue of a question of de Caen about the number of distinct valencies in connected graphs with three distinct eigenvalues. The source gives no resolution of the conjecture.
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.