The minimum covering signless laplacian energy of graph-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

The minimum covering signless laplacian energy of graph

Published:2020-07-01 Issue:1 Volume:1597 Page:012031
ISSN:1742-6588
Container-title:Journal of Physics: Conference Series
language:
Short-container-title:J. Phys.: Conf. Ser.

Author:

Permi Kavita,Manasa H S,Geetha M C

Abstract

Abstract Gutman [5]has come out with the idea of graph energy as summation of numerical value of latent roots of the adjacency matrix of the given graph Γ. In this paper, we introduce the Minumum Covering Signless Laplacian energy

L C + E ( Γ )

of a graph Γ and obtain bounds for it. Also we find

L C + E ( Γ )

of some important class of graphs.

Publisher

IOP Publishing

Subject

General Physics and Astronomy

Link

https://iopscience.iop.org/article/10.1088/1742-6596/1597/1/012031/pdf

Reference14 articles.

1. Bounds for the signless Laplacian energy;Abreu;Linear Algebra Applications,2011

2. The minimum covering energy of a graph;Adiga;Kragujevac Journal of Science,2012

3. On maximum degree energy of a graph;Adiga;Match Communications in Mathematical and in Computer Chemistry,2009

4. Color energy of a graph;Adiga;Proceedings of the Jangjeon Mathematical Society,2013

5. The energy of a graph;Gutman;Ber Math Stat Sek Forschungsz Graz,1978

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP