On the spectral radius of unicyclic graphs with fixed girth

Jianxi Li; Ji Ming Guo; Wai Chee SHIU

On the spectral radius of unicyclic graphs with fixed girth

Jianxi Li, Ji Ming Guo, Wai Chee SHIU

Department of Mathematics

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

2 Citations (Scopus)

Abstract

The spectral radius of a graph is the largest eigenvalue of its adjacency matrix. Let U_n^g be the set of unicyclic graphs of order n with girth g. For all integers n and g with 5≤g≤n−6, we determine the first ⌊g/2⌋+3 spectral radii of unicyclic graphs in the set U_n^g.

Original language	English
Pages (from-to)	65-80
Number of pages	16
Journal	Ars Combinatoria
Volume	108
Publication status	Published - Jan 2013

Scopus Subject Areas

Mathematics(all)

User-Defined Keywords

Characteristic polynomial
Girth
Spectral radius
Unicyclic graph

Cite this

@article{cd5d68305978447d93560ad04f03621a,

title = "On the spectral radius of unicyclic graphs with fixed girth",

abstract = "The spectral radius of a graph is the largest eigenvalue of its adjacency matrix. Let Ung be the set of unicyclic graphs of order n with girth g. For all integers n and g with 5≤g≤n−6, we determine the first ⌊g/2⌋+3 spectral radii of unicyclic graphs in the set Ung.",

keywords = "Characteristic polynomial, Girth, Spectral radius, Unicyclic graph",

author = "Jianxi Li and Guo, {Ji Ming} and SHIU, {Wai Chee}",

year = "2013",

month = jan,

language = "English",

volume = "108",

pages = "65--80",

journal = "Ars Combinatoria",

issn = "0381-7032",

publisher = "Charles Babbage Research Centre",

}

TY - JOUR

T1 - On the spectral radius of unicyclic graphs with fixed girth

AU - Li, Jianxi

AU - Guo, Ji Ming

AU - SHIU, Wai Chee

PY - 2013/1

Y1 - 2013/1

N2 - The spectral radius of a graph is the largest eigenvalue of its adjacency matrix. Let Ung be the set of unicyclic graphs of order n with girth g. For all integers n and g with 5≤g≤n−6, we determine the first ⌊g/2⌋+3 spectral radii of unicyclic graphs in the set Ung.

AB - The spectral radius of a graph is the largest eigenvalue of its adjacency matrix. Let Ung be the set of unicyclic graphs of order n with girth g. For all integers n and g with 5≤g≤n−6, we determine the first ⌊g/2⌋+3 spectral radii of unicyclic graphs in the set Ung.

KW - Characteristic polynomial

KW - Girth

KW - Spectral radius

KW - Unicyclic graph

UR - http://combinatoire.ca/ArsCombinatoria/Vol108.html

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

M3 - Journal article

AN - SCOPUS:84894113895

SN - 0381-7032

VL - 108

SP - 65

EP - 80

JO - Ars Combinatoria

JF - Ars Combinatoria

ER -

On the spectral radius of unicyclic graphs with fixed girth

Abstract

Scopus Subject Areas

User-Defined Keywords

Other files and links

Fingerprint

Cite this