McClelland-Type Upper Bounds for Graph Energy
-
Published:2022
Issue:1
Volume:88
Page:141-155
-
ISSN:0340-6253
-
Container-title:Match Communications in Mathematical and in Computer Chemistry
-
language:
-
Short-container-title:Match
Author:
Milovanović Igor, ,Milovanović Emina,Altindağ Şerife Burcu Bozkurt,Matejić Marjan
Abstract
Let G be a simple graph of order n, without isolated vertices. An important spectrum–based graph invariant is the graph energy. In this paper, we obtain several new upper bounds of the McClelland type on graph energy and characterize graphs for which these bounds are best possible. The bounds represent generalization and improvement of some known results from the literature.
Publisher
University Library in Kragujevac
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Science Applications,General Chemistry
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献