We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
SPN-MATRIX COMPLETION PROBLEM FOR STAR BI-DIRECTED GRAPH.
- Authors
Ponmudi, M. S.; Rameshkumar, A.
- Abstract
In this paper an SPN-Matrix is considered. A Vertex distance path matrix (VDp) representing theStar bidirected 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.
- Subjects
STAR graphs (Graph theory); PATHS &; cycles in graph theory; MATRICES (Mathematics); DIRECTED graphs; EXPONENTIAL functions
- Publication
Bulletin of Pure & Applied Sciences-Mathematics, 2018, Vol 37E, Issue 2, p446
- ISSN
0970-6577
- Publication type
Article
- DOI
10.5958/2320-3226.2018.00047.4