A New Method for the Sum-Edge Characteristic Polynomials of Graphs

Öz, Mert Sinan; Cangul, Ismail Naci

A New Method for the Sum-Edge Characteristic Polynomials of Graphs

dc.contributor.author	Öz, Mert Sinan
dc.contributor.author	Cangul, Ismail Naci
dc.date.accessioned	2024-06-07T06:42:18Z
dc.date.available	2024-06-07T06:42:18Z
dc.date.issued	2022	en_US
dc.department	BTÜ, Mühendislik ve Doğa Bilimleri Fakültesi, Matematik Bölümü	en_US
dc.description.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 provide a formula for calculating the number of smallest odd-sized cycles in a given regular graph.	en_US
dc.identifier.doi	10.5269/bspm.47918	en_US
dc.identifier.issn	0037-8712
dc.identifier.issn	2175-1188
dc.identifier.scopusquality	Q2
dc.identifier.uri	https://hdl.handle.net/20.500.12885/2241
dc.identifier.volume	40	en_US
dc.identifier.wos	WOS:000841490400038
dc.institutionauthor	Öz, Mert Sinan
dc.institutionauthorid	https://orcid.org/0000-0002-6206-0362
dc.language.iso	eng	en_US
dc.publisher	Boletim da Sociedade Paranaense de Matematica
dc.relation.ispartof	Boletim da Sociedade Paranaense de Matematica
dc.relation.publicationcategory	Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı	en_US
dc.rights	info:eu-repo/semantics/openAccess	en_US
dc.subject	Graphs	en_US
dc.subject	Adjacency	en_US
dc.subject	Sum-edge adjacency	en_US
dc.subject	Characteristic polynomial	en_US
dc.subject	Permutation	en_US
dc.title	A New Method for the Sum-Edge Characteristic Polynomials of Graphs	en_US
dc.type	article	en_US