Upper bounds of four types of graph labelings. (Q2829048)
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: Upper bounds of four types of graph labelings. |
scientific article; zbMATH DE number 6644242
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Upper bounds of four types of graph labelings. |
scientific article; zbMATH DE number 6644242 |
Statements
26 October 2016
0 references
prime cordial labeling
0 references
\(k\)-equitable labeling
0 references
(\(k,d\))-odd mean labeling
0 references
\(Z_2\bigoplus Z_2\)-cordial labeling
0 references
Upper bounds of four types of graph labelings. (English)
0 references
In this paper, the authors give upper bounds of the number of edges for four types of labeled graphs of known orders: prime cordial labeling, \(k\)-equitable labeling, (\(k,d\))-odd mean labeling and \(Z_2\bigoplus Z_2\)-cordial labeling.
0 references
0.8006821274757385
0 references
0.7824233174324036
0 references
0.7784813642501831
0 references
0.7778169512748718
0 references
