The Maximum Degree of the Barabási–Albert Random Tree

Volume 14
Issue 03 - May 2005
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 Maximum Degree of the Barabási–Albert Random Tree</div><br><div style="font-size: 10px;"><b>TAMÁS F. MÓRI (2005).</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=14&bVolume=y#loc14 ">Volume 14</a>, <a href="http://journals.cambridge.org/action/displayIssue?jid=CPC&volumeId=14&issueId=03&iid=293400"> Issue 03</a>, May 2005 pp 339-348 <br/> <a href="http://journals.cambridge.org/action/displayAbstract?aid=293400">http://journals.cambridge.org/action/displayAbstract?aid=293400</a></div></div>
The code will display like this:

The Maximum Degree of the Barabási–Albert Random Tree

TAMÁS F. MÓRI (2005).
Combinatorics, Probability and Computing, Volume 14, Issue 03, May 2005 pp 339-348 http://journals.cambridge.org/action/displayAbstract?aid=293400

Blog this Article

Combinatorics, Probability and Computing (2005), 14 : 339-348 Cambridge University Press

Copyright © 2005 Cambridge University Press

doi:10.1017/S0963548304006133 (About doi)

Published online by Cambridge University Press 11 Apr 2005

Social Bookmarking

Username or Email Address	Password

Cambridge Journals Online

Combinatorics, Probability and Computing (2005), 14 : 339-348 Cambridge University Press

Copyright © 2005 Cambridge University Press

doi:10.1017/S0963548304006133 (About doi)

Published online by Cambridge University Press 11 Apr 2005