Extremal Laplacian energy of threshold graphs

Kinkar Ch Das; Seyed Ahmad Mojallal

doi:10.1016/j.amc.2015.10.002

Extremal Laplacian energy of threshold graphs

Kinkar Ch Das, Seyed Ahmad Mojallal

Department of Mathematics

Sungkyunkwan University

Research output: Contribution to journal › Article › peer-review

2 Scopus citations

Abstract

Let G be a connected threshold graph of order n with m edges and trace T. In this paper we give a lower bound on Laplacian energy in terms of n, m and T of G. From this we determine the threshold graphs with the first four minimal Laplacian energies. Moreover, we obtain the threshold graphs with the largest and the second largest Laplacian energies.

Original language	English
Pages (from-to)	267-280
Number of pages	14
Journal	Applied Mathematics and Computation
Volume	273
DOIs	https://doi.org/10.1016/j.amc.2015.10.002
State	Published - 15 Jan 2016

Keywords

Laplacian eigenvalues
Laplacian energy
Threshold graphs

Access to Document

10.1016/j.amc.2015.10.002

Cite this

@article{e4f13e8c9f604442b6fe59c1421ee304,

title = "Extremal Laplacian energy of threshold graphs",

abstract = "Let G be a connected threshold graph of order n with m edges and trace T. In this paper we give a lower bound on Laplacian energy in terms of n, m and T of G. From this we determine the threshold graphs with the first four minimal Laplacian energies. Moreover, we obtain the threshold graphs with the largest and the second largest Laplacian energies.",

keywords = "Laplacian eigenvalues, Laplacian energy, Threshold graphs",

author = "Das, \{Kinkar Ch\} and Mojallal, \{Seyed Ahmad\}",

year = "2016",

month = jan,

day = "15",

doi = "10.1016/j.amc.2015.10.002",

language = "English",

volume = "273",

pages = "267--280",

journal = "Applied Mathematics and Computation",

issn = "0096-3003",

publisher = "Elsevier Inc.",

}

TY - JOUR

T1 - Extremal Laplacian energy of threshold graphs

AU - Das, Kinkar Ch

AU - Mojallal, Seyed Ahmad

PY - 2016/1/15

Y1 - 2016/1/15

N2 - Let G be a connected threshold graph of order n with m edges and trace T. In this paper we give a lower bound on Laplacian energy in terms of n, m and T of G. From this we determine the threshold graphs with the first four minimal Laplacian energies. Moreover, we obtain the threshold graphs with the largest and the second largest Laplacian energies.

AB - Let G be a connected threshold graph of order n with m edges and trace T. In this paper we give a lower bound on Laplacian energy in terms of n, m and T of G. From this we determine the threshold graphs with the first four minimal Laplacian energies. Moreover, we obtain the threshold graphs with the largest and the second largest Laplacian energies.

KW - Laplacian eigenvalues

KW - Laplacian energy

KW - Threshold graphs

UR - https://www.scopus.com/pages/publications/84946109601

U2 - 10.1016/j.amc.2015.10.002

DO - 10.1016/j.amc.2015.10.002

M3 - Article

AN - SCOPUS:84946109601

SN - 0096-3003

VL - 273

SP - 267

EP - 280

JO - Applied Mathematics and Computation

JF - Applied Mathematics and Computation

ER -

Extremal Laplacian energy of threshold graphs

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this