Jump to ContentJump to Main Navigation

Online

43,00 € / $60.00*

* Prices subject to change. Shipping costs will be added.
Publication Date:
09 05 2008
ISSN:
1569-3929
DOI:
10.1515/DMA.2008.004

See all formats and pricing

Print
List price
Euro [D] 2079.00
RRP for USA, Canada, Mexico
US$ 3119.00 *
Online
List price
Euro [D] 43.00
RRP for USA, Canada, Mexico
US$ 60.00 *
Print + Online
List price
Euro [D] 2391.00
RRP for USA, Canada, Mexico
US$ 3587.00 *
*Prices subject to change. Shipping costs will be added.

Discrete Mathematics and Applications

null Chubarikov, Vladimir N. / Ershov, Yu. L. / Prokhorov, Yuri V.

6 Issues per year

VolumeIssuePage

Issues

Volume 22 (2012)

Volume 21 (2011)

Volume 20 (2010)

Volume 19 (2009)

Volume 18 (2008)

Volume 17 (2007)

Volume 16 (2006)

Volume 15 (2005)

Volume 14 (2004)

Volume 13 (2003)

Volume 11 (2001)

Volume 10 (2000)

Volume 9 (1999)

Volume 8 (1998)

Volume 7 (1997)

Volume 6 (1996)

Volume 5 (1995)

Volume 4 (1994)

Volume 3 (1993)

Volume 2 (1992)

Volume 1 (1991)

On enumeration of labelled connected graphs by the number of cutpoints

Voblyi, V. A.

Citation Information: Discrete Mathematics and Applications. Volume 18, Issue 1, Pages 57–69, ISSN (Online) 1569-3929, ISSN (Print) 0924-9265, DOI: 10.1515/DMA.2008.004, May 2008

Publication History:

Received: 21/10/2005;
Published Online: 26/02/2012

Abstract

We study the numbers Smn of labelled connected graphs with n vertices among which m are cutpoints. We obtain an explicit expression for the exponential generating function Sm (Z) of these numbers and find the asymptotics of the numbers Smn as n→ ∞ and m = o(n).

Comments (0)

Please log in or register to comment.