SPN-MATRIX COMPLETION PROBLEM FOR STAR BI-DIRECTED GRAPH
Journal Title: Bulletin of Pure and Applied Sciences Sec. E - Mathematics and Statistics - Year 2018, Vol 37, Issue 2
Abstract
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 anSPN-Matrix. It is shown that the SPN-matrices representing all Star bi-directed graphs Snof n vertices and 2(n-1) edges have an SPN-matrix completion. In addition a study on another distance matrix related to the q distance matrix andthe exponential distance matrix of a tree thathave an SPN–matrix completion is also characterized.
Authors and Affiliations
Dr. A. Rameshkumar
Keywords
Related Articles
- EP ID EP531788
- DOI 10.5958/2320-3226.2018.00047.4
- Views 157
- Downloads 0
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...
Effect of Radiation and Oblateness on the Equilibrium Points in the Elliptic Restricted Three Body Problem
In this paper we have obtained the location of equilibrium points in the elliptic restricted three body problem. We suppose that the bigger primary is oblate and the smaller primary as radiating. We find the positions of...
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...
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...
TYPES OF DOMINATION IN INTUITIONISTIC FUZZY GRAPH BY STRONG ARC AND EFFECTIVE ARC
In this paper, we introduce the definitions of strong arc, non- strong arc, semi μ- strong arc, semi ρ- strong arc, effective arc, semi μ-effective arc and semi ρ-effective arc of intuitionistic fuzzy graph. Further,...