Further results on 3-product cordial labeling.
Author
Jeyanthi, P.
Maheswari, A.
Vijayalakshmi, M.
Abstract
A mapping f : V (G) → {0, 1, 2} is called 3-product cordial labeling if |vf(i) − vf(j)| ≤ 1 and |ef(i) − ef(j)| ≤ 1 for any i, j ∈ {0, 1, 2}, where vf(i) denotes the number of vertices labeled with i, ef(i) denotes the number of edges xy with f(x)f(y) ≡ i(mod 3). A graph with 3-product cordial labeing is called 3-product cordial graph. In this paper we establish that switching of an apex vertex in closed helm, double fan, book graph K1,n × K2 and permutation graph P (K2 + mK1, I) are 3-product cordial graphs.
Metadata
Show full item recordRelated items
Showing items related by title, author, creator and subject.
-
Ethics of cordial reason as complement and basis for an intercultural ethics
Rodríguez Medina, Fabián. Cuadernos de Filosofía; Núm. 32 (2014); 71-90 -
Chile and United Kingdom: ups and downs of a diplomatic relationship not always so cordial (1970-1980)
Bayle, Paola. Estudios Internacionales; Vol. 49 Núm. 186 (2017): Enero-Abril; Pág. 9-38 -
Chile and United Kingdom: ups and downs of a diplomatic relationship not always so cordial (1970-1980)
Bayle, Paola. Estudios Internacionales; Vol. 49 No. 186 (2017): Enero-Abril; Pág. 9-38