Algorithmic approach of cordial labeling on Cartesian product between balanced bipartite graph and path
From MaRDI portal
Publication:5085774
Recommendations
Cites work
- scientific article; zbMATH DE number 4174979 (Why is no real title available?)
- scientific article; zbMATH DE number 4174982 (Why is no real title available?)
- scientific article; zbMATH DE number 4099377 (Why is no real title available?)
- scientific article; zbMATH DE number 1792572 (Why is no real title available?)
- scientific article; zbMATH DE number 951851 (Why is no real title available?)
- scientific article; zbMATH DE number 3997850 (Why is no real title available?)
- scientific article; zbMATH DE number 822754 (Why is no real title available?)
- scientific article; zbMATH DE number 844143 (Why is no real title available?)
- scientific article; zbMATH DE number 3308125 (Why is no real title available?)
- scientific article; zbMATH DE number 4187864 (Why is no real title available?)
- On Additive Bases and Harmonious Graphs
- On multiplicative labelings of a graph
- On the graceful numbering of spanning trees
- Some totally modular cordial graphs
- Strongly multiplicative graphs
This page was built for publication: Algorithmic approach of cordial labeling on Cartesian product between balanced bipartite graph and path
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5085774)