The signless Laplacian and distance signless Laplacian spectral radius of digraphs with some given parameters

Weige Xi; Ligong Wang

doi:10.1016/j.dam.2017.04.036

The signless Laplacian and distance signless Laplacian spectral radius of digraphs with some given parameters

Weige Xi, Ligong Wang

School of Mathematics and Statistics

Northwestern Polytechnical University Xian

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

16 Scopus citations

Abstract

Let q(G) and μ(G) denote the signless Laplacian and distance signless Laplacian spectral radius of a digraph G, respectively. In this paper, we characterize the extremal digraph which has the maximum signless Laplacian spectral radius among all strongly connected digraphs with given dichromatic number. We also determine the extremal digraph having the minimum distance signless Laplacian spectral radius among all strongly connected digraphs with given vertex connectivity.

Original language	English
Pages (from-to)	136-141
Number of pages	6
Journal	Discrete Applied Mathematics
Volume	227
DOIs	https://doi.org/10.1016/j.dam.2017.04.036
State	Published - 20 Aug 2017

Keywords

Dichromatic number
Distance signless Laplacian
Signless Laplacian
Spectral radius
Vertex connectivity

Access to Document

10.1016/j.dam.2017.04.036

Cite this

@article{4b775b2896564e99a471df325e2e6124,

title = "The signless Laplacian and distance signless Laplacian spectral radius of digraphs with some given parameters",

abstract = "Let q(G) and μ(G) denote the signless Laplacian and distance signless Laplacian spectral radius of a digraph G, respectively. In this paper, we characterize the extremal digraph which has the maximum signless Laplacian spectral radius among all strongly connected digraphs with given dichromatic number. We also determine the extremal digraph having the minimum distance signless Laplacian spectral radius among all strongly connected digraphs with given vertex connectivity.",

keywords = "Dichromatic number, Distance signless Laplacian, Signless Laplacian, Spectral radius, Vertex connectivity",

author = "Weige Xi and Ligong Wang",

note = "Publisher Copyright: {\textcopyright} 2017 Elsevier B.V.",

year = "2017",

month = aug,

day = "20",

doi = "10.1016/j.dam.2017.04.036",

language = "英语",

volume = "227",

pages = "136--141",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - The signless Laplacian and distance signless Laplacian spectral radius of digraphs with some given parameters

AU - Xi, Weige

AU - Wang, Ligong

PY - 2017/8/20

Y1 - 2017/8/20

N2 - Let q(G) and μ(G) denote the signless Laplacian and distance signless Laplacian spectral radius of a digraph G, respectively. In this paper, we characterize the extremal digraph which has the maximum signless Laplacian spectral radius among all strongly connected digraphs with given dichromatic number. We also determine the extremal digraph having the minimum distance signless Laplacian spectral radius among all strongly connected digraphs with given vertex connectivity.

AB - Let q(G) and μ(G) denote the signless Laplacian and distance signless Laplacian spectral radius of a digraph G, respectively. In this paper, we characterize the extremal digraph which has the maximum signless Laplacian spectral radius among all strongly connected digraphs with given dichromatic number. We also determine the extremal digraph having the minimum distance signless Laplacian spectral radius among all strongly connected digraphs with given vertex connectivity.

KW - Dichromatic number

KW - Distance signless Laplacian

KW - Signless Laplacian

KW - Spectral radius

KW - Vertex connectivity

UR - http://www.scopus.com/inward/record.url?scp=85019852193&partnerID=8YFLogxK

U2 - 10.1016/j.dam.2017.04.036

DO - 10.1016/j.dam.2017.04.036

M3 - 文章

AN - SCOPUS:85019852193

SN - 0166-218X

VL - 227

SP - 136

EP - 141

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

ER -

The signless Laplacian and distance signless Laplacian spectral radius of digraphs with some given parameters

Abstract

Keywords

Access to Document

Other files and links

Cite this