Generalized k connectivity for graphs and generic graphs is recognized as NP-complete, a parameter that measures the network’s ability to connect vertices. Suppose  km,n a completely connected bipartite graph represents the maximum number of internally disjoint Steiner trees (IDSTs) joining a subset S ⸦ V(G) of k vertices in G. In this context, Steiner trees (or “S -trees”) T1, T2 are considered internally detached if and only if V(T1) ∩ V(T2) = S and E(T1) ∩ E(T2) = ϕ. We define generalized k-connectivity as κk (G). This study focuses on calculating the precise values of generalized k-connectivity for line- graph of bipartite graphs with k = 3, 4 and generalized k-connectivity for bipartite graphs with k ≥ 3.