Cordiality in the context of duplication in Flower related graphs

U M Prajapati, R M. Gajjar

Abstract


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.

Full Text:

PDF

References


M. Andar, S. Boxwala and N. Limaye, Cordial Labelings of Some Wheel related Graphs, J.

Combin. Math. Combin. Comput., 41(2002), 203-208.

M. Andar, S. Boxwala and N. Limaye, A note on Cordial Labelings of Multiple Shells,

Trends Math., (2002), 77-80.

M. Andar, S. Boxwala and N. Limaye, New Families of Cordial Graphs, J. Combin. Math.

Combin. Comput., 53(2005), 117-154.

J. A. Gallian, A Dynamic Survey of Graph Labeling, The Electronic Journal of Combinatorics 17 (2015), #DS6. Online: http://www.combinatorics.org

J. Gross and J. Yellen, Graph Theory and Its Applications, CRC Press, Boca Raton, 1999.

K. Kathiresan, S. Muthuvel and V. Nagasubbu, Consecutive Labelings for Two Classes of

Plane Graphs, Util. Math., 55(1999), 237-241.

K. M. Mominul Haque, X. Lin, Y. Yang and J. Zhang, Prime cordial labeling of Flower

snark and related graphs, Ars Combin., 105(2012), 45-52.

U. M. Prajapati and R. M. Gajjar, Cordial Labeling of Complement of Some Graph, Mathematics

Today, 30(2015), 99-118.

U. M. Prajapati and R. M. Gajjar, Cordial labeling in the context of duplication of graph

elements, International Journal of Mathematics and Soft Computing, 6(2016), 65-73.

N. Ramya, K. Rangarajan and R. Sattanathan, On Prime Labeling of some Classes of

Graphs, International Journal of Computer Applications, 44(2012), 1-3.

S. K. Vaidya and N. A. Dani, Cordial and 3-Equitable Graphs Induced by Duplication of

Edge, Mathematics Today, 27(2011), 71-82.

D. B. West, Introduction to Graph Theory, Prentice-Hall of India, New Delhi, 2001.


Refbacks

  • There are currently no refbacks.




Web Counters

IJMSC has been indexed in several world class data bases like Google Scholar, DRJI (Directory of Research Journals Indexing) ,Cite Factor, Research Bible.

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.