|
|||||
|
|
Path number of bipartite digraphs |
|
| Authors: | William G Frye Renu Laskar |
| Affiliation: | Clemson University, Clemson, South Carolina 29631 USA |
| Abstract: | In this paper it is proved that the path number of the complete symmetric bipartite digraph on n and n vertices is n + 1, thereby establishing a conjecture of Chein. |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ | |