Abstract
We define a row pattern of a matrix as a model (or a condition) to be satisfied by each row of the matrix, independently of the other rows. When applied to adjacency matrices of digraphs, a row pattern allows to define a class of digraphs characterized by a local condition on the out-neighborhood of each vertex, once an appropriate linear ordering of the vertices has been found.We show that the Hamiltonian Cycle and Hamiltonian Path problems are NP-complete on digraphs with simple row patterns, namely C1P-digraphs (where the row pattern describes the consecutive ones property), 2-out-regular digraphs (where each row contains exactly two values 1) and sym-digraphs (where the 1s in each row are symmetric with respect to the main diagonal, as soon as the row contains at least two 1s).Classes with simple row patterns thus show a real structural complexity, despite their simple definitions. Moreover, they raise interesting class recognition problems.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.