Constructing edge-disjoint Steiner trees in Cartesian product networks

arXiv2301.12933MaRDI QIDQ6424820FDOQ6424820

Authors: Rui Li, G. Gutin, He Zhang, Zhao Wang, XiaoYan Zhang, Yaping Mao

Publication date: 26 January 2023

Abstract: Cartesian product networks are always regarded as a tool for ``combining two given networks with established properties to obtain a new one that inherits properties from both. Generalized $k$ -connectivity $l a m b d a_{k} (F)$ of a graph $F$ is a parameter of constructing the maximum number of edge-disjoint Steiner trees (abbreviated to EDSTs) in $F$ . In this paper, we give sharp upper and lower bounds for $l a m b d a_{k} (G B o x H)$ , where $B o x$ is the Cartesian product operation, and $G, H$ are two graphs.

This page was built for publication: Constructing edge-disjoint Steiner trees in Cartesian product networks

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