On the \(E_3\)-cordiality of some graphs (Q2829331)
From MaRDI portal
!
WARNING
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 6644934
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the \(E_3\)-cordiality of some graphs |
scientific article; zbMATH DE number 6644934 |
Statements
27 October 2016
0 references
edge-cordial labellings
0 references
\(E_3\)-codial graph
0 references
\(P_m\times P_n\)
0 references
\(K_{m,n}\)
0 references
trees
0 references
On the \(E_3\)-cordiality of some graphs (English)
0 references
0.8747685551643372
0 references
0.8584527969360352
0 references
