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 124
- Downloads 0
Two Finite Simple Directed Graphs
The main result of the paper is that in practically interesting situations determining the optimal number of colors in the proposed coloring is an NP-hard problem. A possible conclusion to draw from this result is that f...
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...
ON FUNCTIONS OF A SINGLE MATRIX ARGUMENT - III
We prove some Eulerian integrals involving the hypergeometric functions of single matrix argument. The integrals studied here involve the and the functions of matrix argument. We apply the Mathai’s matrix transform t...
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.
RELIABILITY ANALYSIS OF A SYSTEM BY USING SUGENO (TSK) FUZZY MODEL
In the present paper the binary assumption is replaced by a fuzzy state assumption, thereby leading to fuzzy reliability estimates. In reliability estimation failure rate estimation is an important parameter. Available...