Pendant 3-tree-connectivity of augmented cubes

HIGHLIGHTS

• What: The authors show that τ3 (AQn ) = 2n - 3. which attains the upper bound of τ3 (G) given by Hager for G = AQn.
• Who: Mathematics Subject Classification et al. from the University of Pune have published the article: Pendant 3-Tree Connectivity of Augmented Cubes, in the Journal: (JOURNAL)

SUMMARY

Choudum and Sunita showed that the augmented cube of dimension n contains two edge-disjoint complete binary trees on 2n - 1 vertices both rooted at the same vertex, two edge-disjoint spanning binomial trees, and all the k-cycles, 3 ≤ k . . .

 



If you want to have access to all the content you need to log in!

Thanks :)

Username or E-mail:

If you don't have an account, you can create one here.