5 results for “spanning trees”

Set a search alert

Research ArticleOpen accessPhrase in the titleSome 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 accessPhrase in the titleNumber 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 accessPhrase in the titleEnhanced Clustering Techniques for Hyper Network Planning using Minimum Spanning Trees and Ant-Colony AlgorithmLamiaa Fattouh IbrahimProblem statement: The process of network planning is divided into two sub steps. The first step is determining the location of the Multi Service Access Node (MSAN). The second step is the construction of subscriber network lines from MSAN to subscribers to satisfy optimization criteria and design constraints. Due to the complexity of this process artificial intelligence and clustering techniques … …Journal of Computer Science, Vol. 7, Issue 3 · 9 Mar 2011 · 6,813 accessesView PDF Cite

Research ArticleOpen accessIn the keywordsComplexity of Cocktail Party Graph and Crown GraphS. N. DaoudProblem statement: The number of spanning trees τ(G) in graphs (networks) was an important invariant. Approach: Using the properties of the Chebyshev polynomials of the second kind and the linear algebra techniques to evaluate the associated determinants. Results: The complexity, number of spanning trees, of the cocktail party graph on 2n vertices, given in detail in the text was proved. … …American Journal of Applied Sciences, Vol. 9, Issue 2 · 12 Dec 2011 · 7,868 accessesView PDF Cite

Research ArticleOpen accessIn the abstractREDUCING CALL BLOCKING PROBABILITY IN HYBRID MULTICAST WAVELENGTH DIVISION MULTIPLEXING NETWORKS USING WEIGHTED ROUTING AND WAVELENGTH ASSIGNMENT ALGORITHMD. V. Pradeep Sankar, K. MuneeswaranIn the proposed work, the focus is on increasing the available wavelength in the all-optical networks, for which the Routing and Wavelength Assignment plays a vital role. In the earlier reported work, the wavelengths were assigned to the links which covers a set of destinations but not all the intended destinations. However this proposed work, attempts were made to create … …Journal of Computer Science, Vol. 10, Issue 2 · 13 Nov 2013 · 6,849 accessesView PDF Cite