Matching preclusion number in Cartesian product of graphs and its application to interconnection networks. (Q2936663)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6383814
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Matching preclusion number in Cartesian product of graphs and its application to interconnection networks. |
scientific article; zbMATH DE number 6383814 |
Statements
6 January 2015
0 references
Cartesian product
0 references
perfect matching
0 references
matching preclusion
0 references
interconnection network
0 references
fault tolerance
0 references
0.8795205354690552
0 references
0.8790905475616455
0 references
0.8777782917022705
0 references
0.8710827827453613
0 references
0.8592416048049927
0 references
