| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652414 | Electronic Notes in Discrete Mathematics | 2009 | 5 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
