Co-authorship, rational Erdos numbers, and resistance distances in graphs

被引:17
作者
Balaban, AT [1 ]
Klein, DJ [1 ]
机构
[1] Texas A&M Univ, Dept Marine Sci, Galveston, TX 77551 USA
关键词
Span Tree; Complete Graph; Central Vertex; Joint Paper; Joint Publication;
D O I
10.1023/A:1016098803527
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
The Erdos number (EN) for collaborative papers among mathematicians was defined as indicating the topological distance in the graph depicting the co-authorship relations, i. e., EN = 1 for all co-authors of Paul Erdos; EN = 2 for their co-authors who did not publish jointly with Erdos; etc. A refinement of this notion uses resistance distances leading to rational Erdos numbers (REN), which (as indicated by their name) are rational numbers. For acyclic graphs, EN = REN, but for graphs with circuits these numbers differ. Further refinements are possible using weighted edges in the co-authorship graph according to the number of jointly authored papers.
引用
收藏
页码:59 / 70
页数:12
相关论文
共 12 条
[1]  
Doyle P., 1984, Random walks and electric networks, V22
[2]   FUNDAMENTAL PROBLEM OF MATHEMATICS [J].
ERDOS, P .
AMERICAN MATHEMATICAL MONTHLY, 1972, 79 (02) :149-&
[3]   AND WHAT IS YOUR ERDOS NUMBER [J].
GOFFMAN, C .
AMERICAN MATHEMATICAL MONTHLY, 1969, 76 (07) :791-&
[4]  
Harary F., 1979, GRAPH THEORY
[5]  
Harary F., 1971, J REC MATH, V4, P212
[6]   Graph theory in practice: part II [J].
Hayes, B .
AMERICAN SCIENTIST, 2000, 88 (02) :104-109
[7]   RESISTANCE DISTANCE [J].
KLEIN, DJ ;
RANDIC, M .
JOURNAL OF MATHEMATICAL CHEMISTRY, 1993, 12 (1-4) :81-95
[8]  
KLEIN DJ, UNPUB CROAT CHEM ACT
[9]  
Odda T., 1979, ANN NY ACAD SCI, V328, P166
[10]  
Shapiro L.W., 1987, Math. Mag., V60, P36, DOI [DOI 10.1080/0025570X.1987.11977274, /10.1080/0025570X.1987.11977274]