Share Your Research, Maximize Your Social Impacts
Cordialness of arbitrary supersubdivision of graphs
Journal: International Journal of Mathematics and Soft Computing (Vol.6, No. 2)Publication Date: 2016.07.24
Authors : Ujwala Deshmukh; Smita Amogh Bhatavadekar;
Page : 43-56
Keywords : Ladder; cyclic ladder; triangular snake; double triangular snake; subdivision of a graph; supersubdivision of a graph; cordial labeling.;
Source : Download
Find it from : Google Scholar
Abstract
In this paper we prove that arbitrary supersubdivision of ladder, cyclic ladder, triangular snake and certain double triangular snake are cordial.
Other Latest Articles
- Switching of a vertex and independent domination number in graphs
- Edge regular property of cartesian product and composition of two fuzzy graphs
- Graceful and odd graceful labeling of graphs
- Hyers-Ulam stability of Cubic and Quartic Functional Equations in matrix paranormed spaces
- Complementary Nil Eccentric Domination Number of a Graph
Last modified: 2017-08-30 01:44:23