A New Method for the Sum-Edge Characteristic Polynomials of Graphs
Yükleniyor...
Tarih
2022
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Boletim da Sociedade Paranaense de Matematica
Erişim Hakkı
info:eu-repo/semantics/openAccess
Özet
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 provide a formula for calculating the number of smallest odd-sized cycles in a given regular graph.
Açıklama
Anahtar Kelimeler
Graphs, Adjacency, Sum-edge adjacency, Characteristic polynomial, Permutation
Kaynak
Boletim da Sociedade Paranaense de Matematica
WoS Q Değeri
Scopus Q Değeri
Q2
Cilt
40
