The generalized 3-edge-connectivity of lexicographic product graphs (Q2942415)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The generalized 3-edge-connectivity of lexicographic product graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The generalized 3-edge-connectivity of lexicographic product graphs |
scientific article |
Statements
The Generalized 3-Edge-Connectivity of Lexicographic Product Graphs (English)
0 references
11 September 2015
0 references
edge-disjoint paths
0 references
edge-connectivity
0 references
Steiner tree
0 references
edge-disjoint Steiner trees
0 references
generalized edge-connectivity
0 references
0.9251965284347534
0 references
0.8883421421051025
0 references
0.8766085505485535
0 references
0.873666524887085
0 references
0.8694939613342285
0 references
