International Journal of Mathematics and Soft Computing
http://ijmsc.com/index.php/ijmsc
<p style="font-family: arial; color: blue; font-size: 14px;"><strong><strong>International Journal of Mathematics and Soft Computing (IJMSC) is included in the UGC Approved list of Journals...Journal No: 63448</strong></strong></p><div style="font-family: arial; color: red; font-size: 12px;"><strong><strong>Search Title by IJMSC<a href="http://www.ugc.ac.in/journallist/" target="_blank"> http://www.ugc.ac.in/journallist/</a></strong></strong></div><div style="font-family: arial; color: red; font-size: 12px;"><strong><strong>Or Search by ISSN</strong></strong></div><p style="font-family: arial; color: blue; font-size: 14px;"><strong>Cosmos Impact Factor: 5.120, Universal Impact Factor: 28.4587, ICV: 68.58</strong></p>en-USInternational Journal of Mathematics and Soft Computing2249-3328<p>Submission of paper implies transfer of copyright from the authors to the <strong>International Journal of Mathematics and Soft Computing </strong>(<strong>IJMSC</strong>).</p>Cordiality in the context of duplication in Flower related graphs
http://ijmsc.com/index.php/ijmsc/article/view/ijmsc-7-2-8
Let $G = (V(G) , E(G))$ be a graph and let $\displaystyle f:V(G)\rightarrow \{0,1\}$ be a mapping from the set of vertices to \{0,1\} and for each edge $uv \in E$ assign the label $|f(u)-f(v)|$. If the number of vertices labeled with 0 and the number of vertices labeled with 1 differ by at most 1 and the number of edges labled with 0 and the number of edges labeled with 1 differ by at most 1, then $f$ is called a cordial labeling. We discuss cordial labeling of graphs obtained from duplication of certain graph elements in flower related graphs.U M PrajapatiR M. Gajjar
Copyright (c) 2017 International Journal of Mathematics and Soft Computing
2017-08-132017-08-137289101