Some totally modular cordial graphs

  • Cahit I
N/ACitations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

In this paper we define total magic cordial (TMC) and total sequential cordial (TSC) labellings which are weaker versions of magic and simply sequential labellings of graphs. Based on these definitions we have given several results on TMC and TSC graphs.

Cite

CITATION STYLE

APA

Cahit, I. (2002). Some totally modular cordial graphs. Discussiones Mathematicae Graph Theory, 22(2), 247. https://doi.org/10.7151/dmgt.1173

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free