Pendant 3-tree Connectivity of Augmented Cubes

S. A. Mane, S. A. Kandekar

The Steiner tree problem in graphs has applications in network design or circuit layout. Given a set $S$ of vertices, $|S|\ge 2,$ a tree connecting all vertices of $S$ is called…