Algorithmic approach of cordial labeling on Cartesian product between balanced bipartite graph and path (Q5085774): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.31801/cfsuasmas.586082 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2956061515 / rank | |||
Normal rank | |||
Revision as of 22:31, 19 March 2024
scientific article; zbMATH DE number 7549265
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithmic approach of cordial labeling on Cartesian product between balanced bipartite graph and path |
scientific article; zbMATH DE number 7549265 |
Statements
Algorithmic approach of cordial labeling on Cartesian product between balanced bipartite graph and path (English)
0 references
27 June 2022
0 references
cordial labeling
0 references
graph labeling
0 references
Cartesian product of graphs
0 references
