Contents

Ars Combinatoria

  • Research article

A Necessary and Sufficient Condition for a Graph to be \(E_2\)-Cordial

Qing Liu1, Zhishan Liu2
1 School of Statistics and Research Center of Applied Statistics Jiangxi University of Finance and Economics, Nanchang, 330013, P.R.China
2 Department of Mathematics, Yang-en University, Quanzhou, 362014, P.R.China
  • Published: 31/10/2015

Abstract

In this paper, \(E_2\)-cordiality of a graph \(G\) is considered. Suppose \(G\) contains no isolated vertex, it is shown that \(G\) is \(E_2\)-cordial if and only if \(G\) is not of order \(4n + 2\).

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
Qing Liu, Zhishan Liu. A Necessary and Sufficient Condition for a Graph to be \(E_2\)-Cordial[J], Ars Combinatoria, Volume 123. 159-167. .