Why Us? >>

  • - Open Access
  • - Peer-reviewed
  • - Rapid publication
  • - Lifetime hosting
  • - Free indexing service
  • - Free promotion service
  • - More citations
  • - Search engine friendly

Free SCIRP Newsletters>>

Add your e-mail address to receive free newsletters from SCIRP.

 

Contact Us >>

WhatsApp  +86 18163351462(WhatsApp)
   
Paper Publishing WeChat
Book Publishing WeChat
(or Email:book@scirp.org)

Article citations

More>>

Vaidya, S.K. and Barasara, C.M. (2013) Some New Families of Edge Product Cordial Graphs. Advanced Modeling Optimization, 15, 103-111.
http://camo.ici.ro/journal/vol15/v15a9.pdf

has been cited by the following article:

  • TITLE: Some Edge Product Cordial Graphs in the Context of Duplication of Some Graph Elements

    AUTHORS: Udayan M. Prajapati, Prakruti D. Shah

    KEYWORDS: Graph Labeling, Edge Product Cordial Labeling, Duplication of a Vertex

    JOURNAL NAME: Open Journal of Discrete Mathematics, Vol.6 No.4, September 9, 2016

    ABSTRACT: For a graph, a function is called an edge product cordial labeling of G, if the induced vertex labeling function is defined by the product of the labels of the incident edges as such that the number of edges with label 1 and the number of edges with label 0 differ by at most 1 and the number of vertices with label 1 and the number of vertices with label 0 differ by at most 1. In this paper, we show that the graphs obtained by duplication of a vertex, duplication of a vertex by an edge or duplication of an edge by a vertex in a crown graph are edge product cordial. Moreover, we show that the graph obtained by duplication of each of the vertices of degree three by an edge in a gear graph is edge product cordial. We also show that the graph obtained by duplication of each of the pendent vertices by a new vertex in a helm graph is edge product cordial.