Steiner distances in generalized corona products

Abstract The Steiner distance of a subset of vertices in a graph is the minimum size among all the connected subgraphs containing this subset. This paper focuses on the study of Steiner distances in both generalized vertex corona (GVC) and generalized edge corona (GEC) products, and the relationship with their corresponding center and outer graphs. Particularly, we show how Steiner distances in GEC products can be computed from those ones in GVC products, and we also establish sharp bounds for their Steiner numbers, eccentricities, radii, diameters and k -Wiener indices. In this way, we extend some known results on corona products.