The asymptotic covering density of generalized Petersen graphs

John, Peter E. GND; Sachs, Horst GND

Remark on the paper "Minimum vertex covers in the generalized Petersen graphs P(n; 2)" by M. Behzad, P. Hatami, and E.S. Mahmoodian

Dedicated to Tomaz Pisanski on the occasion of his 60th birthday

The covering density of a graph G=(V,E) is delta(G)= beta(G)/|V|where beta(G), the covering number, is the minimum number of vertices that represent all edges of G. The asymptotic covering density of the generalized Petersen graph is determined.

Cite

Citation style:

John, Peter E. / Sachs, Horst: The asymptotic covering density of generalized Petersen graphs. 2009.

Access Statistic

Total:
Downloads:
Abtractviews:
Last 12 Month:
Downloads:
Abtractviews:

open graphic

Rights

Use and reproduction:
All rights reserved

Export