《网络拓扑学与关系式P=m+n-1的证明》一文的更正
出处
《大学物理》
1985年第12期22-22,共1页
College Physics
-
1梁灿彬.网络拓扑学与关系式p= m+n-1的证明[J].大学物理,1985,0(3):9-13. 被引量:3
-
2张白珊.电磁学中的场和路[J].内江师范学院学报,2009,24(4):90-92. 被引量:1
-
3钱建平.实现基本回路矩阵所对应的线形树的方法[J].江苏电机工程,2002,21(4):1-4.
-
4钱建平.由矩阵实现为图的树形法[J].江苏电机工程,2000,19(3):18-21. 被引量:1
-
5钱建平.图实现的成对分解方法[J].南京理工大学学报,1999,23(6):494-498.
-
6DONG Cheng-Dong,LIU Zeng-Rong.An Ideal Assortative Network and Synchronization[J].Communications in Theoretical Physics,2007,47(1):186-192.
-
7赵小梅,高自友.Topological Effects on the Performance of Transportation Networks[J].Chinese Physics Letters,2007,24(1):283-286. 被引量:5
-
8WU Jian-Jun GAO Zi-You SUN Hui-Jun.Unified Model for Generation Complex Networks with Utility Preferential Attachment[J].Communications in Theoretical Physics,2006,46(1X):183-186.
-
9袁五届,罗晓曙,杨仁桓.Stochastic Resonance in Neural Systems with Small-World Connections[J].Chinese Physics Letters,2007,24(3):835-838. 被引量:2
-
10李永,方锦清,刘强.Mapping Nuclear Decay to a Complex Network[J].Communications in Theoretical Physics,2012,57(3):490-492. 被引量:1