On the acyclic point-connectivity of the n -cube

John Banks and John Mitchem

International Journal of Mathematics and Mathematical Sciences, 1982, vol. 5, 1-8

Abstract:

The acyclic point-connectivity of a graph G , denoted α ( G ) , is the minimum number of points whose removal from G results in an acyclic graph. In a 1975 paper, Harary stated erroneously that α ( Q n ) = 2 n − 1 − 1 where Q n denotes the n -cube. We prove that for n > 4 , 7 ⋅ 2 n − 4 ≤ α ( Q n ) ≤ 2 n − 1 − 2 n − y − 2 , where y = [ log 2 ( n − 1 ) ] . We show that the upper bound is obtained for n ≤ 8 and conjecture that it is obtained for all n .

Date: 1982
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/5/389820.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/5/389820.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:389820

DOI: 10.1155/S0161171282000684

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 ().