科研之友
微信
新浪微博
Facebook
分享链接
摘要
The rank of a graph G is defined to be the rank of its adjacency matrix. A connected graph G of rank n is called long if it has maximum diameter among all connected graphs with rank n. In this paper, we characterize the long graphs of rank n, for n an arbitrary positive integer.
- 出版日期2013-2-1
- 单位中国矿业大学（北京）
