2013
DOI: 10.1587/transinf.e96.d.433
|View full text |Cite
|
Sign up to set email alerts
|

The First Eigenvalue of (<i>c</i>,<i>d</i>)-Regular Graph

Abstract: SUMMARYWe show a phase transition of the first eigenvalue of random (c, d)-regular graphs, whose instance of them consists of one vertex with degree c and the other vertices with degree d for c > d. We investigate a reduction from the first eigenvalue analysis of a general (c, d)-regular graph to that of a tree, and prove that, for any fixed c and d, and for a graph G chosen from the set of all (c, d)-regular graphs with n vertices uniformly at random, the first eigenvalue of G is approximately max{d, c/ √ c −… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 11 publications
(10 reference statements)
0
1
0
Order By: Relevance
“…The expression of ( 27) was also obtained recently in a mathematically rigorous manner for ∆ = 1 [37]. We will term solutions of this type defect solutions because of their physical implications shown by the following naive analysis [11].…”
Section: Defect Modelmentioning
confidence: 88%
“…The expression of ( 27) was also obtained recently in a mathematically rigorous manner for ∆ = 1 [37]. We will term solutions of this type defect solutions because of their physical implications shown by the following naive analysis [11].…”
Section: Defect Modelmentioning
confidence: 88%