Algorithmic approach of cordial labeling on Cartesian product between balanced bipartite graph and path (Q5085774): Difference between revisions

Latest revision as of 11:10, 29 July 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

instance of

scholarly article

0 references

title

Algorithmic approach of cordial labeling on Cartesian product between balanced bipartite graph and path (English)

0 references

0 references

0 references

Communications Faculty Of Science University of Ankara Series A1Mathematics and Statistics

0 references

publication date

27 June 2022

0 references

zbMATH Keywords

cordial labeling

0 references

graph labeling

0 references

Cartesian product of graphs

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.31801/cfsuasmas.586082

0 references

cites work

Q3532226

0 references

Strongly multiplicative graphs

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Some totally modular cordial graphs

0 references

On the graceful numbering of spanning trees

0 references

Q4552153

0 references

On Additive Bases and Harmonious Graphs

0 references

Q5589124

0 references

Q3825114

0 references

Identifiers

zbMATH Open document ID

1492.05137

0 references

DOI

10.31801/cfsuasmas.586082

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5085774

@@ Property / cites work @@
+Q3532226
@@ Property / cites work: Q3532226 / rank @@
+Normal rank
@@ Property / cites work @@
+Strongly multiplicative graphs
@@ Property / cites work: Strongly multiplicative graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4724671
@@ Property / cites work: Q4724671 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3199455
@@ Property / cites work: Q3199455 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3199452
@@ Property / cites work: Q3199452 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5752611
@@ Property / cites work: Q5752611 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4856633
@@ Property / cites work: Q4856633 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4865128
@@ Property / cites work: Q4865128 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4717037
@@ Property / cites work: Q4717037 / rank @@
+Normal rank
@@ Property / cites work @@
+Some totally modular cordial graphs
@@ Property / cites work: Some totally modular cordial graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the graceful numbering of spanning trees
@@ Property / cites work: On the graceful numbering of spanning trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q4552153
@@ Property / cites work: Q4552153 / rank @@
+Normal rank
@@ Property / cites work @@
+On Additive Bases and Harmonious Graphs
@@ Property / cites work: On Additive Bases and Harmonious Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5589124
@@ Property / cites work: Q5589124 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3825114
@@ Property / cites work: Q3825114 / rank @@
+Normal rank