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

Thumbnail Image

Organizational Units

Authors

Öz, Mert Sinan
Cangül, İsmail Naci

Advisor

Language

Publisher:

Soc Paranaense Matematica

Journal Title

Journal ISSN

Volume Title

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.

Description

Source:

Keywords:

Keywords

Energy, Graphs, Adjacency, Sum-edge adjacency, Characteristic polynomial, Permutation, Science & technology, Physical sciences, Mathematics

Citation

Endorsement

Review

Supplemented By

Referenced By

1

Views

13

Downloads

View PlumX Details