ON DIVISOR CORDIAL GRAPH

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

VARIANCE BALANCED INCOMPLETE BLOCK DESIGNS

This paper provides two new series for the construction for General Efficiency Balanced Incomplete Block Design using the combinatorial arrangement of Efficiency Balanced Incomplete Block Designs.

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 Behaviour of a Two-State Stand by Redundant Power Plant under Arbitrary Failure Time Distribution

This paper presents the investigations for the evaluation of reliability of the power supply having been carried out with the help of Boolean function orthogonalization algorithm. The motive of the complex system is to s...

APPLICATION OF MIXED QUADRATURE FOR NUMERICAL EVALUATION OF FRACTIONAL INTEGRALS

In this paper, we improve the corrective factor approach using a mixed quadrature rule for numerical integration of fractional integral of order

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...

Download PDF file
  • EP ID EP531737
  • DOI 10.5958/2320-3226.2018.00032.2
  • Views 127
  • Downloads 0

How To Cite

S. P. Reshma (2018). ON DIVISOR CORDIAL GRAPH. Bulletin of Pure and Applied Sciences Sec. E - Mathematics and Statistics, 37(2), 290-302. https://europub.co.uk./articles/-A-531737