Two Upper Bounds of Prime Cordial Graphs

We give an upper bound on the number of edges of a graph with \( n \) vertices to be a prime cordial graph, and we improve this upper bound to fit bipartite graphs. Also, we determine all prime cordial graphs of order \( \leq 6 \).