UPPER BOUNDS ON THE ENERGY OF GRAPHS IN TERMS OF MATCHING NUMBER

Applicable Analysis and Discrete Mathematics

article

Saieed Akbari¹  Abdullah Alazemi²  Milica Anđelić² 

[1] Department of Mathematical Sciences, Sharif University of Technology;Department of Mathematics, Kuwait University

关键词: Energy (of graph);    Graph energy;    Matching number;   

DOI  :  10.2298/AADM201227016A

学科分类：社会科学、人文和艺术（综合）

来源: Univerzitet u Beogradu * Elektrotehnicki Fakultet / University of Belgrade, Faculty of Electrical Engineering

【 摘 要 】

The paper is organized as follows. In Section 2 we present preliminary resultsneeded for the remaining content of the paper. Section 3 includes three upperbounds on graph energy. For the first one, already known in the literature, in termsof matching number and the largest edge degree we present new, shorter proof.The remaining bounds are in terms of graph order (resp. matching number) andthe largest vertex degree. In Section 4 we present two open problems.

【 授权许可】

Unknown