4-Total prime cordial labeling of some cycle related graphs

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Ponraj r.; Maruthamani j.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF ALGORITHMS AND COMPUTATION Year:2018 | Volume:50 | Issue:2 Page(s): 49-57

Download Full-Text

View:

149

Download:

Cites:

Information Journal Paper

Title

4-Total prime cordial labeling of some cycle related graphs

Author(s)

Ponraj r. | Maruthamani j. | Issue Writer Certificate

Keywords

Prism

Helm

Dumbbell graph

Sun ower graph

Abstract

Let G be a (p; q) graph. Let f: V (G)! f1; 2; : : :; kg be a map where k 2 N and k > 1. For each edge uv, assign the label gcd(f(u); f(v)). f is called k-Total prime cordial labeling of G if jtf (i) 􀀀 tf (j)j 1, i; j 2 f1; 2; ; kg where tf (x) denotes the total number of vertices and the edges labelled with x. A graph with a k-total prime cordial labeling is called k-total prime cordial graph. In this paper we investigate the 4-total prime cordial labeling of some graphs like Prism, Helm, Dumbbell graph, Sun ower graph.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

Ponraj, r., & Maruthamani, j.. (2018). 4-Total prime cordial labeling of some cycle related graphs. JOURNAL OF ALGORITHMS AND COMPUTATION, 50(2), 49-57. SID. https://sid.ir/paper/354561/en

Vancouver: Copy

Ponraj r., Maruthamani j.. 4-Total prime cordial labeling of some cycle related graphs. JOURNAL OF ALGORITHMS AND COMPUTATION[Internet]. 2018;50(2):49-57. Available from: https://sid.ir/paper/354561/en

IEEE: Copy

r. Ponraj, and j. Maruthamani, “4-Total prime cordial labeling of some cycle related graphs,” JOURNAL OF ALGORITHMS AND COMPUTATION, vol. 50, no. 2, pp. 49–57, 2018, [Online]. Available: https://sid.ir/paper/354561/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops