Combinatorics and Graph Theory

1804 Submissions

[2] viXra:1804.0172 [pdf] submitted on 2018-04-12 14:37:14

Bipolar Neutrosophic Minimum Spanning Tree

Authors: Said Broumi, Assia Bakali, Mohamed Talea, Florentin Smarandache, Kifayat Ullah
Comments: 6 Pages. Broumi, Said and Talea, Mohamed and Bakali, Assia and Smarandache, Florentin and Ullah, Kifayat, Bipolar Neutrosophic Minimum Spanning Tree (February 27, 2018). Smart Application and Data Analysis for Smart Cities (SADASC'18). Available at SSRN: https://s

The aim of this article is to introduce a matrix algorithm for finding minimum spanning tree (MST) in the environment of undirected bipolar neutrosophic connected graphs (UBNCG). Some weights are assigned to each edge in the form of bipolar neutrosophic number (BNN). The new algorithm is described by a flow chart and a numerical example by considering some hypothetical graph. By a comparison, the advantage of proposed matrix algorithm over some existing algorithms are also discussed.
Category: Combinatorics and Graph Theory

[1] viXra:1804.0165 [pdf] submitted on 2018-04-12 10:43:40

Zastosowanie Teorii Grafów do Analizy Stabilności Stanów Stacjonarnych W Sieciach Reakcji Enzymatycznch [praca Doktorska, 1978] ### Application of Graph Theory to Stability Analysis of Steady States in Enzymatic Reaction Networks [PhD Thesis, 1978]

Authors: Zbigniew Osiak
Comments: 156 Pages. In Polish

Rozpatrywane w tej pracy rodzaje grafów można utworzyć na podstawie równań stechiometrycznych. Główną zaletą metod grafowych jest możliwość uzyskania informacji o stabilności stanów stacjonarnych bez wypisywania w jawnej postaci jakichkolwiek równań. ### The types of graphs considered in this work can be created on the basis of stoichiometric equations. The main advantage of the graph theory methods is the possibility of obtaining information on the stability of steady states without writing out any equations in an explicit form.
Category: Combinatorics and Graph Theory