Contents

Ars Combinatoria

  • Research article

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

Liu Zhishan1, Zhu Biwen2
1Yang-en University, Quanzhou, 362014, P.R.China
2Inner Mongolia Agriculture University, Huhhot, 010019, P.R.China
  • Published: 31/07/2007

Abstract

In this paper, we give a necessary and sufficient condition for a \(3\)-regular graph to be cordial.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

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

Citation
Liu Zhishan, Zhu Biwen. A Necessary and Sufficient Condition for a \(3\)-Regular Graph to be Cordial[J], Ars Combinatoria, Volume 084. 225-230. .