On the $E_k$-Total Cordiality of Some Graphs

Liu, Qing; Liu, Zhishan; Wu, Haiping

Abstract

References

Ars Combinatoria

Volume 120
Pages: 193-198

Research article

On the $E_{k}$ -Total Cordiality of Some Graphs

^¹, ^², ^³

¹School of Statistics and Research Center of Applied Statistics, Jiangxi University of Finance and Economics, Nanchang 330013, P.R.China.

²Department of Mathematics, Yang-en University, Quanzhou 362014, P.R.China.

³School of Tourism and Urban Management, Jiangxi Uni- versity of Finance and Economics, Nanchang 330013, P.R.China.

Published: 30/04/2015

Download PDF
Cite

Copyright Link
License

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.

Contents

Ars Combinatoria

On the $E_{k}$ -Total Cordiality of Some Graphs

Abstract

Information

Guidelines

CP Initiatives

Follow CP

Contents

Ars Combinatoria

On the Ek-Total Cordiality of Some Graphs

Abstract

Information

Guidelines

CP Initiatives

Follow CP

On the $E_{k}$ -Total Cordiality of Some Graphs