Neighborhood Cordial (Nhd-C) Labeling - A New Method of Graph Labeling
Journal Title: Bulletin of Pure and Applied Sciences Sec. E - Mathematics and Statistics - Year 2018, Vol 37, Issue 1
Abstract
We introduce a new technique of graph labeling named as Neighborhood Cordial (Nhd-C) Labeling of Graphs and show that paths, cycles, FL (Cn), S (C3,n), pathunion Pm(C3), Pm (C4),K1,m: K1,m , TreeYn are nhd-c graphs.
Authors and Affiliations
Dr. Mukund V. Bapat
Keywords
Related Articles
- EP ID EP531606
- DOI 10.5958/2320-3226.2018.00003.6
- Views 133
- Downloads 0
Application of Magneto-Williamson Model in Nanofluid Flow
This paper investigates the effect of the nano particle effect on magneto hydrodynamic boundary layer over a stretching in the current of heat generation or absorption with heat and mass fluxes. The governing partial dif...
Common Fixed Point for Compatible Mappings of Type () Satisfying an Implicit Relation
Here we prove a common fixed point theorem for compatible mappings of type () satisfying an implicit relation. We extend results of Popa [9] for five mappings.
NON-ARCHIMEDEAN STABILITY AND NON-STABILITY OF QUADRATIC RECIPROCAL FUNCTIONAL EQUATION IN SEVERAL VARIABLES
In this paper,we prove the stability of quadratic reciprocal functional equation in several variables of the type
ON INTEGRAL SOLUTIONS OF TERNARY QUADRATIC DIOPHANTINE EQUATION
In this paper, we analyze the ternary quadratic homogeneous Diophantine equation for finding its non – zero integer solutions. The proposed equation represents a homogeneous cone and its distinct integer solutions repre...
DOMINATION IN CARTESIAN PRODUCT OF FUZZY GRAPHS USING STRONG ARC
In this paper the domination in fuzzy graphs by using strong arcs are generalized and established the domination concept in Cartesian product on standard fuzzy graphs using strong arcs and non strong arcs