ON DIVISOR CORDIAL GRAPH
Journal Title: Bulletin of Pure and Applied Sciences Sec. E - Mathematics and Statistics - Year 2018, Vol 37, Issue 2
Abstract
In this paper we prove that some known graphs such as the Herschel graph and some graphs constructed in this paper are divisor cordial graphs.
Authors and Affiliations
S. P. Reshma
Keywords
Related Articles
- EP ID EP531737
- DOI 10.5958/2320-3226.2018.00032.2
- Views 125
- 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...
ACCELERATION MOTION OF A SINGLE VERTICALLY FALLING NON-SPHERICAL PARTICLE IN INCOMPRESSIBLE NON-NEWTONIAN FLUID BY DIFFERENT METHODS
An analytical investigation is applied for acceleration motion of a vertically falling non-spherical particle in a Shear-thinning (n<1) and Shear-thickening (n>1) power low fluid. The acceleration motion of vertically fa...
COCHAIN-VALUED THEORY IN TOPOLOGICAL FIELD THEORY
We determine the category of boundary conditions in the case that the closed string algebra is semisimple. We find that sewing constraints - the most primitive form of worldsheet locality - already imply that D-branes ar...
A STUDY ON THE EFFECTIVE EDGES IN THE CARTESIAN PRODUCT OF FUZZY GRAPHS
In this paper we discuss the number of effective edges in the Cartesian product of fuzzy graphs. Some basic theorems and results are obtained on effective edges. Based on the results we find the effective edge domination...
SPN-MATRIX COMPLETION PROBLEM FOR STAR BI-DIRECTED GRAPH
In this paper an SPN-Matrix is considered. A Vertex distance path matrix (VDp) representing theStar bi-directed graph Sn is said to have an SPN-completion if every partial SPN-matrix specifying VDp can be completed to an...