共查询到19条相似文献,搜索用时 171 毫秒
1.
在图论中,网络拓扑结构关系可以用关联矩阵A,或基本回路矩阵B,或基本割集C来表示.这三个矩阵之间的关系为ABT=0及BCT=0.相关的电路教材对此关系进行了数学证明.本文通过网络的拓扑结构关系来证明这三个网络矩阵间的关系,相对于数学原理的方法,能够反映出矩阵间内部的逻辑联系,并在证明过程中,提出一些有关网络矩阵的补充定理,完善网络图论的知识体系. 相似文献
2.
周蕾 《电气电子教学学报》2007,29(1):23-26
本文通过对割集电压方程建立过程的理论分析,提出并证明了一种直接的、更为简便的列写割集电压方程的方法.该方法避免了传统的割集电压方程建立过程中繁复的矩阵运算,对一些不太复杂的网络,本法可以用直观的方法,通过电路的图、树、独立割集及割集方向,并按照一定的规则即可列写出割集导纳矩阵Yi、割集电流源列向量J·i,进而得到电路的割集电压方程. 相似文献
3.
4.
5.
根据用户随意输入的结点个数以及给定二元关系的关系矩阵,利用矩阵的乘幂运算、加法运算和0,1化处理,求二元关系的传递闭包对应的关系矩阵。使用VB开发工具实现相应的运算,并绘制二元关系及其传递闭包的关系图。VB中未提供直接绘制有向弧的方法,文中采取按弧长比例选点适当偏移的方法画箭头,取得了较为理想的效果。 相似文献
6.
本文提出了用Coates图分析和设计有源开关电容滤波器(SCF)的方法。文中首先归纳出直接由有源SCF画Coates图的规则,然后由给定传递函数,提出一种根据Coates图设计有源SCF的方法,所设计的SCF元件参数可直接由传递函数的系数决定。 相似文献
7.
8.
讨论了用联络矩阵法求网络系统从输入节点到输出节点的所有最小路集,给出了一种实现此方法的计算机算法,画出了实现此算法的PAD图,此算法在网络系统可靠性分析方面具有很好的应用价值。 相似文献
9.
10.
KCL、KVL和特勒根定理描述了电路的拓扑约束关系,三者之间的关系是:任意两者可推导出第三者。本文在文献[3]的基础上,借助于电路图论和基本回路矩阵、基本割集矩阵的概念给出了关于KCL、KVL和特勒根定理相互关系的证明。本文的讨论有助于深刻理解KCL、KVL和特勒根定理及其之间的关系,可供从事电路教学的教师参考。 相似文献
11.
Wu Y. Jain K. Kung S.-Y. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》2006,52(6):2398-2409
Given a network of lossless links with rate constraints, a source node, and a set of destination nodes, the multicast capacity is the maximum rate at which the source can transfer common information to the destinations. The multicast capacity cannot exceed the capacity of any cut separating the source from a destination; the minimum of the cut capacities is called the cut bound. A fundamental theorem in graph theory by Edmonds established that if all nodes other than the source are destinations, the cut bound can be achieved by routing. In general, however, the cut bound cannot be achieved by routing. Ahlswede et al. established that the cut bound can be achieved by performing network coding, which generalizes routing by allowing information to be mixed. This paper presents a unifying theorem that includes Edmonds' theorem and Ahlswede et al.'s theorem as special cases. Specifically, it shows that the multicast capacity can still be achieved even if information mixing is only allowed on edges entering relay nodes. This unifying theorem is established via a graph theoretic hardwiring theorem, together with the network coding theorems for multicasting. The proof of the hardwiring theorem implies a new proof of Edmonds' theorem. 相似文献
12.
The matrix D describing relations of the loops to the nodes in the graph and also the setsof branches based on the independent loops and their matrix Q are defined.The theorem in whichthe product of the loop-node matrix D multiplied by the incidence matrix A_a is equal to matrix Qis put forward and proved.The admittance matrix Y_(lc) of the sets of the branches is defined and it isassumed that the vector V_(lc) of voltage of the sets of branches to be a calculative quantity.The equa-tion of the sets of branches is derived and the analysis method of the sets of branches based on theindependent loops in the electric network is presented. 相似文献
13.
本文定义了描述网络图回路与节点关联状况的矩阵D,定义了回路岔集和回路岔集矩阵。提出并证明了回路节点矩阵与节点矩阵的乘积等于回路岔集矩阵的定理。定义了回路岔集导纳矩阵,假设回路岔集电压矢量作为中间计算量,导出了回路岔集方程,并提出了对电网络的回路岔集分析法。 相似文献
14.
网络最短路径问题可以作为许多实际应用问题的模型,但传统的求解算法其迭代过程复杂.本文描述了基于矩阵乘法的最短路算法,其时间复杂度与Dijkstra算法相同.在给定的一个网络图中,在不改变网络图中的最短路的条件下,删除"多余"的结点或边,可以达到简化网络图和提高求解速度的目的,从而降低计算复杂性.最后,研究了该方法在最短路径问题和旅行商问题中的应用.实例表明,这种算法与传统的动态规划技术相比,具有运算简便、易于理解的优点. 相似文献
15.
本文把讯号流图推广到有向矩阵系统,提出一种广义的讯号流图定义及其拓扑法则,并给出了复杂网络系统的若干应用实例。 相似文献
16.
K. P. RAJAPPAN 《International Journal of Electronics》2013,100(2):155-158
A practical method is described for testing whether a given matrix can be realized as a graph or not. The method is based on one's geometrical intuition in seeing whether or not certain configurations can be drawn in plane and the test can be carried out evon by an unskilled person. 相似文献
17.
The given functions specifications are represented as a reduced n-cell graph, and its incidence matrix is constructed. The prime implicant table for the given functions is then obtained by a systematic search of the matrix for sub-graphs satisfying certain properties. This table is represented as a linear graph, and the trees of this graph are tagged with a cost depending on the prime implicants in them. The tree with the minimum cost generates the desired optimal network. 相似文献
18.
对于小型网络系统,可用联络矩阵法求出系统的最小路集,进而求出系统的可靠性。在具体分析某交通网络系统的基础上,建立了网络图模型,用联络矩阵法分析了系统可靠性及可靠性敏感度。 相似文献