Random subgraphs of certain graph powers

Lane Clark

International Journal of Mathematics and Mathematical Sciences, 2002, vol. 32, 1-8

Abstract:

We determine the limiting probability that a random subgraph of the Cartesian power K a n or of K a , a n is connected.

Date: 2002
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/32/132090.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/32/132090.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:132090

DOI: 10.1155/S0161171202201210

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().