No, you don’t have to declare anything, and the matrices don’t have to have an exactly regular pattern.
My point was simply that sparse-direct algorithms (for \) tend to be more efficient for non-random sparsity patterns, and in general their efficiency varies for matrices with different patterns of nonzeros even if the number of nonzeros is the same.