scientific article; zbMATH DE number 94970
From MaRDI portal
Publication:4020464
Recommendations
Cited in
(31)- Cordial labeling of \(mK_ n\)
- \(C\)-cordial labeling in signed graphs
- Uniformly cordial graphs
- The cordiality of the sum and union of two fourth power of paths and cycles
- On cordial labelings of the second power of cycles with other graphs
- On graceful and cordial labeling of shell graphs.
- Cordially of the complete graphs
- Study of some problems of cordial graphs
- The cordiality of complete bipartite graph \(K_{rs}\) and Hadamard matrix
- On cordial labelings of the second power of paths with other graphs.
- scientific article; zbMATH DE number 6342172 (Why is no real title available?)
- scientific article; zbMATH DE number 4179408 (Why is no real title available?)
- Graceful and cordial labeling of subdivision of graphs
- scientific article; zbMATH DE number 4210187 (Why is no real title available?)
- scientific article; zbMATH DE number 4210188 (Why is no real title available?)
- scientific article; zbMATH DE number 5307941 (Why is no real title available?)
- 2-splittable and cordial graphs
- scientific article; zbMATH DE number 5529050 (Why is no real title available?)
- scientific article; zbMATH DE number 5575770 (Why is no real title available?)
- scientific article; zbMATH DE number 19195 (Why is no real title available?)
- scientific article; zbMATH DE number 7009334 (Why is no real title available?)
- scientific article; zbMATH DE number 7442448 (Why is no real title available?)
- On cordial related labeling of isomorphic copies of paths and subdivision of star
- Algorithmic approach of cordial labeling on Cartesian product between balanced bipartite graph and path
- scientific article; zbMATH DE number 7296912 (Why is no real title available?)
- On cordial labeling of hypertrees
- scientific article; zbMATH DE number 7708012 (Why is no real title available?)
- Cordial labelings of a class of planar graphs
- On partitional labelings of graphs
- The cordiality of one-point union of n copies of a graph
- On friendly index sets of 2-regular graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4020464)