A study on the varieties of equivalent cordial labeling graphs
The concepts of cordial labeling, signed product cordiality, and logical cordiality have been introduced independently by different researchers as distinct labeling schemes. In this paper, we demonstrate the equivalence of these concepts. Specifically, we prove that a graph $ G $ is cordial if and o...
Saved in:
Main Authors: | M. E. Abdel-Aal, S. A. Bashammakh |
---|---|
Format: | Article |
Language: | English |
Published: |
AIMS Press
2024-12-01
|
Series: | AIMS Mathematics |
Subjects: | |
Online Access: | https://www.aimspress.com/article/doi/10.3934/math.20241653 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
On derived t-path, t=2,3 signed graph and t-distance signed graph
by: Deepa Sinha, et al.
Published: (2025-06-01) -
Fixed-point-free embeddings of graphs in their complements
by: Seymour Schuster
Published: (1978-01-01) -
The Edge Odd Graceful Labeling of Water Wheel Graphs
by: Mohammed Aljohani, et al.
Published: (2024-12-01) -
An introduction of F-graphs, a graph-theoretic representation of natural numbers
by: E. J. Farrell
Published: (1992-01-01) -
Longest cycles in certain bipartite graphs
by: Pak-Ken Wong
Published: (1998-01-01)