Strong subgraph 2-arc-connectivity and arc-strong connectivity of Cartesian product of digraphs

Let \(D=(V,A)\) be a digraph of order \(n\), \(S\) a subset of \(V\) of size \(k\) and \(2\le k\leq n\). A strong subgraph \(H\) of \(D\) is called an \(S\)-strong subgraph if \(S\subseteq V(H)\). A pair of \(S\)-strong subgraphs \(D_1\) and \(D_2\) are said to be arc-disjoint if \(A(D_1)\cap A(D_2)...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2022-04
Hauptverfasser:	Dong, Yiling, Gutin, Gregory, Sun, Yuefang
Format:	Artikel
Sprache:	eng
Schlagworte:	Cartesian coordinates Connectivity Graph theory Upper bounds
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!