An edge-separating theorem on the second smallest normalized laplacian eigenvalue of a graph and its applications

Jianxi Li; Ji Ming Guo; Wai Chee Shiu; An Chang

doi:10.1016/j.dam.2014.02.020

An edge-separating theorem on the second smallest normalized laplacian eigenvalue of a graph and its applications

Jianxi Li^*
, Ji Ming Guo
, Wai Chee Shiu
, An Chang

^*Corresponding author for this work

Department of Mathematics

Research output: Contribution to journal › Journal article › peer-review

14 Citations (Scopus)

Abstract

Let ^λ2(G) be the second smallest normalized Laplacian eigenvalue of a graph G. In this paper, we investigate the behavior on ^λ2(G) when the graph G is perturbed by separating an edge. This result can be used to determine all trees and unicyclic graphs with ^λ2(G)≥1-22. Moreover, the trees and unicyclic graphs with ^λ2(G)=1-22 are also determined, respectively.

Original language	English
Pages (from-to)	104-115
Number of pages	12
Journal	Discrete Applied Mathematics
Volume	171
DOIs	https://doi.org/10.1016/j.dam.2014.02.020
Publication status	Published - 10 Jul 2014

User-Defined Keywords

Edge-separating
Second smallest normalized Laplacian eigenvalue
Tree
Unicyclic graph

Access to Document

10.1016/j.dam.2014.02.020

Cite this

@article{695715b151d746df9db2a5086ac35df8,

title = "An edge-separating theorem on the second smallest normalized laplacian eigenvalue of a graph and its applications",

abstract = "Let λ2(G) be the second smallest normalized Laplacian eigenvalue of a graph G. In this paper, we investigate the behavior on λ2(G) when the graph G is perturbed by separating an edge. This result can be used to determine all trees and unicyclic graphs with λ2(G)≥1-22. Moreover, the trees and unicyclic graphs with λ2(G)=1-22 are also determined, respectively.",

keywords = "Edge-separating, Second smallest normalized Laplacian eigenvalue, Tree, Unicyclic graph",

author = "Jianxi Li and Guo, \{Ji Ming\} and Shiu, \{Wai Chee\} and An Chang",

note = "Funding Information: Partially supported by NSF of China (Nos. 11101358 , 61379021 , 11371372 ); NSF of Fujian (Nos. 2011J05014 , 2011J01026 ); Project of Fujian Education Department (No. JA11165); Postdoctoral Foundation of Fuzhou University; General Research Fund of Hong Kong ; Faculty Research Grant of Hong Kong Baptist University . ",

year = "2014",

month = jul,

day = "10",

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

language = "English",

volume = "171",

pages = "104--115",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - An edge-separating theorem on the second smallest normalized laplacian eigenvalue of a graph and its applications

AU - Li, Jianxi

AU - Guo, Ji Ming

AU - Shiu, Wai Chee

AU - Chang, An

N1 - Funding Information: Partially supported by NSF of China (Nos. 11101358 , 61379021 , 11371372 ); NSF of Fujian (Nos. 2011J05014 , 2011J01026 ); Project of Fujian Education Department (No. JA11165); Postdoctoral Foundation of Fuzhou University; General Research Fund of Hong Kong ; Faculty Research Grant of Hong Kong Baptist University .

PY - 2014/7/10

Y1 - 2014/7/10

N2 - Let λ2(G) be the second smallest normalized Laplacian eigenvalue of a graph G. In this paper, we investigate the behavior on λ2(G) when the graph G is perturbed by separating an edge. This result can be used to determine all trees and unicyclic graphs with λ2(G)≥1-22. Moreover, the trees and unicyclic graphs with λ2(G)=1-22 are also determined, respectively.

AB - Let λ2(G) be the second smallest normalized Laplacian eigenvalue of a graph G. In this paper, we investigate the behavior on λ2(G) when the graph G is perturbed by separating an edge. This result can be used to determine all trees and unicyclic graphs with λ2(G)≥1-22. Moreover, the trees and unicyclic graphs with λ2(G)=1-22 are also determined, respectively.

KW - Edge-separating

KW - Second smallest normalized Laplacian eigenvalue

KW - Tree

KW - Unicyclic graph

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

U2 - 10.1016/j.dam.2014.02.020

DO - 10.1016/j.dam.2014.02.020

M3 - Journal article

AN - SCOPUS:84898542447

SN - 0166-218X

VL - 171

SP - 104

EP - 115

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

ER -

An edge-separating theorem on the second smallest normalized laplacian eigenvalue of a graph and its applications

Abstract

User-Defined Keywords

Access to Document

Other files and links

Fingerprint

Cite this