The Path Resistance Method for Bounding the  Smallest Nontrivial Eigenvalue of a Laplacian

Volume 8
Issue 05 - Sep 1999
Add to Basket £30.00 / $45.00
Request Permissions
Cited by Articles (CrossRef)
Cited by Articles (Google Scholar)
Citation Alert
Go to Next Abstract in TOC
Go to Previous Abstract in TOC
Blog this Article close

Copy and paste this code to insert a reference to this article in your blog or online community profile:

Highlight All
<div style="background: #FFFFFF; margin: 10px 10px 10px 10px; padding: 10px 10px 10px 20px; text-align: left; border-top: 1px dashed #a5bbd1; border-left: 10px solid #a5bbd1; font-family: Verdana, Geneva, sans-serif;"><br> <div style="font-size: 12px; padding: 0px 0px 10px 0px; font-weight:bold; color: #003366;">The Path Resistance Method for Bounding the Smallest Nontrivial Eigenvalue of a Laplacian </div><br><div style="font-size: 10px;"><b>S. GUATTERY,T. LEIGHTON and G. L. MILLER (1999).</b><br /> <a href="http://journals.cambridge.org/action/displayJournal?jid=CPC">Combinatorics, Probability and Computing</a>, <a href="http://journals.cambridge.org/action/displayJournal?jid=CPC&volumeId=8&bVolume=y#loc8 ">Volume 8</a>, <a href="http://journals.cambridge.org/action/displayIssue?jid=CPC&volumeId=8&issueId=05&iid=46731"> Issue 05</a>, September 1999 pp 441-460 <br/> <a href="http://journals.cambridge.org/action/displayAbstract?aid=46731">http://journals.cambridge.org/action/displayAbstract?aid=46731</a></div></div>
The code will display like this:

The Path Resistance Method for Bounding the Smallest Nontrivial Eigenvalue of a Laplacian

S. GUATTERY, T. LEIGHTON and G. L. MILLER (1999).
Combinatorics, Probability and Computing, Volume 8, Issue 05, September 1999 pp 441-460 http://journals.cambridge.org/action/displayAbstract?aid=46731

Blog this Article

Combinatorics, Probability and Computing (1999), 8 : 441-460 Cambridge University Press

doi:10.1017/S0963548399003958 (About doi)

Social Bookmarking

Username or Email Address	Password

Cambridge Journals Online

Combinatorics, Probability and Computing (1999), 8 : 441-460 Cambridge University Press

doi:10.1017/S0963548399003958 (About doi)