3 articles for “kirchhoff matrix”

Set a search alert

Research ArticleOpen accessIn the keywordsSome Applications of Spanning Trees in Complete and Complete Bipartite GraphsS. N. DaoudProblem statement: The number of spanning trees τ(G) in graphs (networks) is an important invariant, it is also an important measure of reliability of a network. Approach: Using linear algebra and matrix analysis techniques to evaluate the associated determinants. Results: In this study we derive simple formulas for the number of spanning trees of complete graph Kn and complete bipartite … …American Journal of Applied Sciences, Vol. 9, Issue 4 · 15 Feb 2012 · 7,263 accessesView PDF Cite

Research ArticleOpen accessIn the keywordsNumber of Spanning Trees of Circulant Graphs C6n and their ApplicationsS. N. DaoudProblem statement: The number of spanning trees of a graph G is usually denoted by τ(G). A circulant graph with n vertices and k jumps is Cn (a1,…..,ak). Approach: In this study the number τ(G) of spanning trees of the circulant graphs C6n with some non-fixed jumps such as C6n (1, n), C6n (1, n, 2n), C6n (1, n, 3n), … …Journal of Mathematics and Statistics, Vol. 8, Issue 1 · 12 Dec 2011 · 7,626 accessesView PDF Cite

Research ArticleOpen accessIn the abstractA New Approach to Load Flow Analysis for Radial Distribution System - Application for Medium Voltage Distribution System in MoroccoSaad Ouali, Abdeljabbar CherkaouiThis paper presents a load flow algorithm based on the backward/forward sweep principle, flexible for radial distribution system reconfiguration, with an improvement in ensuring a minimum number of searching for connections between nodes in the calculation sequence in the forward and the backward sweep, by organizing the radial distribution system information into a Main-Line and its derivations. The proposed load … …American Journal of Engineering and Applied Sciences, Vol. 12, Issue 3 · 29 Jun 2019 · 8,393 accessesView PDF Cite