Affiliation:
1. Bursa Technical University
Abstract
In this paper, the determinant of the sum-edge adjacency matrix of any given graph without loops is calculated by means of an algebraic method using spanning elementary subgraphs and also the coefficients of the corresponding sum-edge characteristic polynomial are determined by means of the elementary subgraphs. Also we gave a formula for the number of smallest odd-sized cycles in a given regular graph.
Publisher
Sociedade Paranaense de Matematica
Reference17 articles.
1. Ashraf, F., Energy, matching number and odd cycles of graphs, Linear Algebra and its Applications 577, 159-167, (2019). https://doi.org/10.1016/j.laa.2019.04.029
2. Bapat, R. B., Graphs and Matrices, Springer, New York (2014). https://doi.org/10.1007/978-1-4471-6569-9
3. Biggs, N., Algebraic Graph Theory, Cambridge University Press, Cambridge (1974). https://doi.org/10.1017/CBO9780511608704
4. Brouwer, A. E., Haemers, W. H., Spectra of Graphs, Springer, New York (2012). https://doi.org/10.1007/978-1-4614-1939-6
5. Chung, F. R. K., Spectral Graph Theory, CBMS 92, American Mathematical Society, Rhode Island (2009).