| Cordial labeling of graphs |
|---|
| Author(s): |
| G Divya Dharshini, U Mary |
| ISSN: |
| 2349-6002 |
| Cite This Article: |
Cordial labeling of graphs, International Journal of Innovative Research in Technology(www.ijirt.org) ,ISSN: 2349-6002 ,Volume 5 ,Issue 9 ,Page(s):165-167 ,February 2019 ,Available :IJIRT147602_PAPER.pdf |
| Keywords: |
| Cordial labeling ,Splitting graph |
| Abstract |
| Let G={V,E} be a graph. A mapping f : V(G)→{0,1} is called Binary Vertex Labeling. A Binary Vertex Labeling of a graph G is called a Cordial Labeling if |v_f (0)-v_f (1)|≤1 and |e_f (0)-e_f (1)|≤1. A graph G is Cordial if it admits Cordial Labeling. Here, we prove that Sunlet graph (S_n) and Shell graph C_((n,n-3)) are Cordial and the Splitting graphs of them are also Cordial. |
| Article Details |
| Unique Paper ID: 147602 Publication Volume & Issue: Volume 5, Issue 9 Page(s): 165 - 167 |
| Article Preview & Download |
|
|
International Journal of Innovative Research in Technology
( An International Open Access Journal & and ISSN Approved )
IJIRTEXPLORE- Search Thousands of research papers
Call For Paper December 2019 Last Date 25 - December 2019
About Us
IJIRT.org enables door in research by providing high quality research articles in open access market.
Send us any query related to your research on editor@ijirt.org
Social Media
Google Verified Reviews
