期刊文献+

完全图K_(52)的电流图构造分析

Analysis of the Construction of Current Diagram in Complete Figure K_(52)
原文传递
导出
摘要 阐述将完全图K_(52)的电流图根据与三个一度点相邻弧的电流赋值情况分为两类,通过先对垂直弧进行电流赋值,再根据上下端弧的对应关系,利用KCL电流定律可以求出电流图的所有不同的电流赋值方式。通过该算法思路,利用Python编程得到完全图K_(52)的电流图共有535680种不同的电流赋值方式。 This paper expounds that the current diagram of complete K_(52) can be divided into two categories based on the current assignment of adjacent arcs to three degree points.By first assigning current values to the vertical arc,and then using the corresponding relationship between the upper and lower arcs,using the KCL current law,all different current assignment methods of the current diagram can be obtained.Through this algorithm approach,it utilizes Python programming to obtain a complete current graph of K_(52),with a total of 535680 different current assignment methods.
作者 冯玉琮 FENG Yucong(Minzu University of China,Beijing 100081,China)
机构地区 中央民族大学
出处 《电子技术(上海)》 2023年第12期164-166,共3页 Electronic Technology
关键词 电流图 电路算法 电路构造 current diagram circuit algorithm circuit construction
  • 引文网络
  • 相关文献

参考文献1

二级参考文献18

  • 1Bonningtong C P, Grannel M J, Griggs T S, et al.. Exponential families of non-isomorphic triangulations of complete graphs. J Combin Theory Set B, 78:169-184 (2000).
  • 2Korzhik V, Voss H-J. On the number nonisomorphic orientable regular embeddings of complete graphs. J Combin Theory Set B, 81:58-76 (2001).
  • 3Korzhik V, Voss H-J. Exponential families of nonisomorphic nontriangular orientble genus embeddings of complete graphs. J Combin Theory Ser B, 86:186-211 (2002).
  • 4Korzhik V. Exponentially many triangular embeddings of K12s. Preprint.
  • 5Korzhik V. Exponentially many triangular embeddings of K12s+3. Preprint.
  • 6Bondy J A, Murty U S R. Graph Theory with Application. London: Macmillan, 1979.
  • 7Nebesky L. A new characterization of the maximum genus of a graph. Czechoslovak Math J, 31(106): 604-613 (1981).
  • 8Huang Y Q. On the maximum genus of graphs. Dissertation for Doctoral Degree. Beijing: Northern Jiaotong University, 1996.
  • 9Xuong N H. How to determine the maximum genus of a graph. J Combin Theory Ser B, 23:217 225 (1979).
  • 10Liu Y P. The maximum orientable genus of a graph (Chinese with English abstract). Scientia Sinica, 22(Special Issue on Math Ⅱ): 41-55 (1979).

共引文献3

;
使用帮助 返回顶部