Matching Energy of Graphs with Maximum Degree at Most 3
-
Published:2023
Issue:3
Volume:89
Page:687-697
-
ISSN:0340-6253
-
Container-title:match Communications in Mathematical and in Computer Chemistry
-
language:
-
Short-container-title:match
Author:
Ghezelahmad Somayeh Khalashi,
Abstract
The matching energy of a graph G, denoted by ME(G), is def ined as the sum of absolute values of the zeros of the matching polynomial of G. In this paper, we prove that if G is a connected graph of order n with maximum degree at most 3, then ME(G) > n with only six exceptions. In particular, we show that there are only two connected graphs with maximum degree at most three, whose matching energies are equal to the number of vertices.
Publisher
University Library in Kragujevac
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Science Applications,General Chemistry