Skip to content
Home
About CP
Overview
Editorial Office
News & Announcements
Journals
Ars Combinatoria
Utilitas Mathematica
Journal of Combinatorial Mathematics and Combinatorial Computing
Congressus Numerantium
Online Journal of Analytic Combinatorics
Information
Guide for Authors
Guide for Reviewers
Guide for Editors
Editorial Workflow
Publication Ethics
Open Access Policy
Copyright Policy
Order Article Reprints
Guide for Subscribers
Guide for Conference Organizers
Special Issue Guidelines
Authors Services
CP Books
Contact Us
Home
About CP
Overview
Editorial Office
News & Announcements
Journals
Ars Combinatoria
Utilitas Mathematica
Journal of Combinatorial Mathematics and Combinatorial Computing
Congressus Numerantium
Online Journal of Analytic Combinatorics
Information
Guide for Authors
Guide for Reviewers
Guide for Editors
Editorial Workflow
Publication Ethics
Open Access Policy
Copyright Policy
Order Article Reprints
Guide for Subscribers
Guide for Conference Organizers
Special Issue Guidelines
Authors Services
CP Books
Contact Us
Search
Contents
Abstract
-
References
Ars Combinatoria
Volume 084
Pages: 225-230
Research article
A Necessary and Sufficient Condition for a
3
-Regular Graph to be Cordial
Liu Zhishan
1
,
Zhu Biwen
2
1
Yang-en University, Quanzhou, 362014, P.R.China
2
Inner Mongolia Agriculture University, Huhhot, 010019, P.R.China
Published: 31/07/2007
Download PDF
Cite
Copyright Link
License
Abstract
In this paper, we give a necessary and sufficient condition for a
3
-regular graph to be cordial.
