207
PROGRAMS
OFFERED
OFFERED
A weighted digraph graph D is said to be doubly stochastic if all the weights of the edges in D are in [0, 1] and sum of the weights of the edges incident to each vertex in D is one. Let Ω(G) be denoted as set of all doubly stochastic digraphs with n vertices. We defined a Graph Mates in Ω(G) and derived a necessary and sufficient condition for two doubly stochastic digraphs are to be a Graph Mates. © 2009 Elsevier B.V. All rights reserved.
cited By (since 1996)0
Dr. Somasundaram K., “Graph Mates”, Electronic Notes in Discrete Mathematics, vol. 33, pp. 37-41, 2009.