Affiliation:
1. Institute of Mathematics of the National Academy of Sciences of Belarus
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.
Publisher
Publishing House Belorusskaya Nauka
Subject
Computational Theory and Mathematics,General Physics and Astronomy,General Mathematics
Reference10 articles.
1. Cvetković D., Rowlinson P., Simić S. An Introduction to the Theory of Graph Spectra. Cambridge University Press, 2011. https://doi.org/10.1017/CBO9780511801518
2. Gantmacher F. R. The Theory of Matrices. Moscow, Fizmatlit Publ., 2010. 560 p. (in Russian).
3. Sciriha I., Cardoso D. M. Necessary and sufficient conditions for a Hamiltonian graphs. Journal of Combinatorial Mathematics and Combinatorial Computing, 2012, vol. 80, pp. 127–150.
4. Benediktovich V. I. Eigenvalues, traceability, and perfect matching of a graph. Vestsі Natsyianal’nai akademіі navuk Belarusі. Seryia fіzіka-matematychnykh navuk = Proceedings of the National Academy of Sciences of Belarus. Physics and Mathematics series, 2021, vol. 57, no. 3, pp. 274–285 (in Russian). https://doi.org/10.29235/1561-2430-2021-57-3-274-285
5. Kopylov G. N. Maximal paths and cycles in a graph. Doklady Akademii nauk SSSR = Proceedings of the USSR Academy of Sciences, 1977, vol. 234, no. 1, pp. 19–21 (in Russian).