A new method for the sum-edge characteristic polynomials of graphs | Zendy

Mert Sinan Öz | Zendy; İsmail Naci Cangül | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A new method for the sum-edge characteristic polynomials of graphs

Author(s) -

Mert Sinan Öz,

İsmail Naci Cangül

Publication year - 2022

Publication title -

boletim da sociedade paranaense de matemática

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.347

H-Index - 15

eISSN - 2175-1188

pISSN - 0037-8712

DOI - 10.5269/bspm.47918

Subject(s) - combinatorics , mathematics , adjacency matrix , adjacency list , enhanced data rates for gsm evolution , discrete mathematics , graph , computer science , telecommunications

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research