Pendant 3-tree Connectivity of Augmented Cubes

MaRDI QIDQ6375629zbMATH OpenFDO

Authors S. A. Mane, S. A. Kandekar

Publication date 19 August 2021

Mathematics Subject Classification ID

Partial orders, general (06A06) Rings with involution; Lie, Jordan and other nonassociative structures (16W10) Abstract operator algebras on Hilbert spaces (47L30)

Abstract: The Steiner tree problem in graphs has applications in network design or circuit layout. Given a set $S$ of vertices, $|S|geq2,$ a tree connecting all vertices of $S$ is called an $S$-Steiner tree (tree connecting $S$). The reliability of a network $G$ to connect any $S$ vertices ($|S|$ number of vertices) in $G$ can be measure by this parameter. For an $S$-Steiner tree, if the degree of each vertex in $S$ is equal to one, then that tree is called a pendant S-Steiner tree. Two pendant $S$-Steiner trees $T$ and $T^{\prime }$ are said to be internally disjoint if $E(T)capE(T^{\prime })=emptyset$ and $V(T)capV(T^{\prime })=S.$ The local pendant tree-connectivity $a{u}_G(S)$ is the maximum number of internally disjoint pendant $S$-Steiner trees in $G.$ For an integer $k$ with $2leqkleqn,$ the pendant k-tree-connectivity is defined as $a{u}_k(G)=mina{u}_G(S):SsubseteqV(G),|S|=k.$ In this paper, we study the pendant $3$-tree connectivity of Augmented cubes which are modifications of hypercubes invented to increase the connectivity and decrease the diameter hence superior to hypercubes. We show that $a{u}_3(A{Q}_n)=2n-3.$ , which attains the upper bound of $a{u}_3(G)$ given by Hager, for $G=A{Q}_n$.

This page was built for publication: Pendant 3-tree Connectivity of Augmented Cubes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6375629)