718 problems
Let and be trees. Assume that they are simultaneously co-spectral, their complements are co-spectral, and their line graphs are co-spectral. Geodesic-growth conjecture. Th…
Odd-coordinate kernel conjecture. Then
A cubic -circulant nut graph is a cubic nut graph admitting an -circulant structure. Nonexistence conjecture for cubic -circulant nut graphs. There exists no cubic -cir…
Kirchhoff-index ordering conjecture. For ,
Weak Loewner spectral-dominance conjecture. The matrices and satisfy
Cardoso–Luz conjecture. All adverse graphs are -graphs.
Let be a bipartite graph with vertices. The minimum distance signless Laplacian spread conjecture. … Equality holds if and only if … This proposes that the balanced complet…
Let be a tree on vertices. Write for its inverse sum indegree energy, and let and denote the star and path on vertices, respecti…
Let and . Write for the class of weighted trees on vertices with total edge weight , and let the energy of a weighted tree be the sum of…
Cheeger-constant Nordhaus-Gaddum conjecture. If , then
The path-matrix conjecture. If is 2-connected, then its path matrix has exactly one positive eigenvalue.
Let be a connected graph, and let denote its spectral radius, its degree vector, and its degree variance. Define the degree deviation by…
Conjecture on ternary strong nodal domains. For any eigenfunction of , , with eigenvalue we have .
Let be a decorated unicyclic graph with cycle length parameter , let be its curvature operator, and let denote the Perron metric. Write … and let be…
Central-quotient eigengap conjecture. Either , or
Let be the generalised pancake graph and let be the associated matrix used in the paper. For a symmetric matrix or graph, write …
Let ) be a connected -regular graph with adjacency matrix and vertices. Let be orthogonal eigenvectors of , with the conditions stated b…
Let be the complete multipartite graph with parts, each of size , and let denote the -analogue of the zero…
For each fixed integer , determine, for all sufficiently large integers , the maximum signless-Laplacian spectral radius among all -v…
For every real , let be the maximum order of a connected -regular graph whose second-largest adjacency-matrix eigenvalue is at most . The Yan…
Let be a distance-regular graph with valency , diameter , and eigenvalues . Define . Is…
For every finite graph with maximum degree and every integer , the lazy Glauber dynamics on the set of proper -colorings of has mixing tim…
Every amply regular graph with parameters satisfying and satisfies .
Let denote the number of induced paths on four vertices (induced -paths) in a simple graph . For integers and , call a -regular graph on vert…
Let be the undirected Aleshin level graph with . The Malyshev–Pak conjecture asserts that is an expander family: there exists a constant ,…