第十五章 网络拓扑和电路方程的矩阵形式(The fifteenth chapter matrix form of network topology and circuit equation).docVIP

第十五章 网络拓扑和电路方程的矩阵形式(The fifteenth chapter matrix form of network topology and circuit equation).doc

  1. 1、本文档共13页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  5. 5、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  6. 6、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  7. 7、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  8. 8、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
第十五章 网络拓扑和电路方程的矩阵形式(The fifteenth chapter matrix form of network topology and circuit equation)

第十五章 网络拓扑和电路方程的矩阵形式(The fifteenth chapter matrix form of network topology and circuit equation) The fifteenth chapter is the matrix form of network topology and circuit equation Section 1 topological graph of network First, the network diagram: 1, topology: In the analysis of the circuit, regardless of the nature of the circuit elements, only the connection mode, that is, the network topology. If each branch with a line (line length, and is not limited to) said that the composition of the topological graph. As shown in figure 15-1-1 (a), the topology of the corresponding circuit is (B). The topology of the corresponding circuit of Fig. 15-1-2 (a) is (B). The topological graph of the corresponding circuit at low frequency in Fig. 15-1-3 (a) is (B). The topological graph is connected graph. (b) a separation diagram of mutual inductance circuits. (b) a topological graph in low frequency, a separate graph, including self loops (self loops), dangling and isolated nodes. 2 、 directed graph: if the reference voltage is referred to the branch voltage and the current, then the directed graph. 3. Subgraph: if all nodes and branches of graph G1 are the nodes and branches of graph G, then G1 is the subgraph of G. Subgraphs can be many. Second section tree, cut set One tree: 1. Definition: the tree G of connected graph T is a subgraph of G. (1) it is together. (2) including all nodes in G. (3) does not contain any loops. A tree is the minimum set of branches that connects all nodes in a graph but does not contain loops. The same topology can have different trees. For a fully connected graph with n nodes, nn-2 different trees can be chosen. 2, tree branch and even branch: when the tree is determined, all the branches of the figure G belong to T, called tree branch, and the others are connected branches. Tree count T=n-1; even count L=b- (n-1). Two, cut set: Definition: the connected graph, C cut set is a set of branches, if the C will make all of the branches are removed, the ori

您可能关注的文档

文档评论(0)

jgx3536 + 关注
实名认证
文档贡献者

该用户很懒,什么也没介绍

版权声明书
用户编号:6111134150000003

1亿VIP精品文档

相关文档