Contents

Ars Combinatoria

  • Research article

On the \(E_k\)-Total Cordiality of Some Graphs

Qing Liu1, Zhishan Liu2, Haiping Wu3
1School of Statistics and Research Center of Applied Statistics, Jiangxi University of Finance and Economics, Nanchang 330013, P.R.China.
2Department of Mathematics, Yang-en University, Quanzhou 362014, P.R.China.
3School of Tourism and Urban Management, Jiangxi Uni- versity of Finance and Economics, Nanchang 330013, P.R.China.
  • Published: 30/04/2015

Abstract

In this paper, we first provide two necessary conditions for a graph \(G \) to be \(E_k\)-cordial, then we prove that every \(P_n(n \geq 3)\) is \(E_p\)-cordial if \(p\) is odd. In the end, we discuss the \(E_2\)-cordiality of a graph \)G\) under the condition that some subgraph of \(G\) has a \(1\)-factor.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

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

Citation
Qing Liu, Zhishan Liu, Haiping Wu. On the \(E_k\)-Total Cordiality of Some Graphs[J], Ars Combinatoria, Volume 120. 193-198. .