A necessary and sufficient condition for a graph to be \(E_2\)-cordial. (Q2828862)
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 6644084
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A necessary and sufficient condition for a graph to be \(E_2\)-cordial. |
scientific article; zbMATH DE number 6644084 |
Statements
26 October 2016
0 references
\(E_2\)-cordial graph
0 references
maximal matching
0 references
A necessary and sufficient condition for a graph to be \(E_2\)-cordial. (English)
0 references
0.8531659841537476
0 references
0.7833175659179688
0 references
0.7658753991127014
0 references
