Contents

-

Ars Combinatoria

  • Research article

On Product Cordial Graphs

M. A.Seoud1, E.F. Helmi2
1 Department of Mathematics, Faculty of Science , Ain Shams University, Abbassia , Cairo, Egypt.
2 Department of Mathematics, Faculty of Science , Ain Shams University, Abbassia , Cairo, Egypt.
  • Published: 31/07/2011

Abstract

Here, we determine all graphs of order less than 7 which are not product cordial.Also, we give some families of graphs which are product cordial.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

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