Path-connectivity of lexicographic product graphs (Q2804863)
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: Path-connectivity of lexicographic product graphs |
scientific article; zbMATH DE number 6577935
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Path-connectivity of lexicographic product graphs |
scientific article; zbMATH DE number 6577935 |
Statements
Path-connectivity of lexicographic product graphs (English)
0 references
6 May 2016
0 references
connectivity
0 references
internally disjoint paths connecting \(S\)
0 references
packing
0 references
path-connectivity
0 references
lexicographic product
0 references
0.97765183
0 references
0.9418433
0 references
0.93482393
0 references
0.9309238
0 references
0.91664994
0 references
0.9096482
0 references
0.90640634
0 references
0.9028981
0 references
0.90238976
0 references
0.8988372
0 references
