Abstract
It is known that the existence of many classical combinatorial structures in a graph, such as perfect matchings, Hamiltonian cycles, effective dominating sets, etc., can be characterized using (κ,τ)-regular sets, whose determination is equivalent to the determination of these classical combinatorial structures. On the other hand, the determination of (κ,τ)regular sets is closely related to the properties of the main spectrum of a graph. We use the previously obtained generalized properties of (κ,τ)-regular sets of graphs to develop a recognition algorithm of the traceability of a graph. We also obtained new sufficient conditions for the existence of a longest simple path in a graph in terms of the spectral radius of the adjacency matrix and the signless Laplacian of the graph.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Proceedings of the National Academy of Sciences of Belarus. Physics and Mathematics Series
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.