In this paper, a novel concept of independent set is proposed in bipolar fuzzy graph setting. The fuzzy topological parameters to measure its degree of independence are defined, and the characteristics of bipolar independence degree are obtained by using graph theory and fuzzy set theory, especially...
https://en.wikipedia.org/wiki/Glossary_of_graph_theory 图论术语-英文版 https://en.wikipedia.org/wiki/Category:Graph_algorithms 图论算法-英文版 https://zh.wikipedia.org/wiki/图论术语 中文版,内容少,“最短路”词条甚至出现了错误 http://discretemath.imp.fu-berlin.de/DMI-2016/notes/BCE.pdf 正文...
In mathematics, graphs are useful in geometry and certain parts of topology such as knot theory. Algebraic graph theory has close links with group theory.可以通过为图的每条边分配一个权重来扩展图结构。
Matchings and Independent Sets of a Fixed Size in Regular Graphs We use an entropy based method to study two graph maximization problems. We upper bound the number of matchings of fixed size in a d-regular graph on N ve... T Carroll,D Galvin,P Tetali - 《Journal of Combinatorial Theory...
Info. Theory 28, 2 (1982), 129–137. [119]Lotfifar Foad and Johnson Matthew. 2015. A multi-level hypergraph partitioning algorithm using rough set clustering. In Proceedings of the 21st International Conference on Parallel and Distributed Computing (EuroPar’15) (LNCS), Vol. 9233. Springer,...
— T. S. Motzkin, on the theme of Ramsey Theory. Let s and t be positive integers. We de?ne the Ramsey Number R(s, t) to be the minimum integer n for which every red-blue coloring of the edges of Kn contains either a completely red Ks or a completely blue Kt . Ramsey’s ...
In this study, we have provided graph-theoretic arguments for the characterization of the convergence properties of such opinion dynamic models based on extensive existing knowledge of convergence and mixing time of random walks on graphs using the theory of Markov chains. We have shown that converge...
Based on my lecture given there, I shall survey those parts of Extremal Graph Theory that are connected most directly with Paul Erdős’s work. In Turán type extremal problems we usually have some sample graphs L1,…,Lr, and consider a graph G n on n vertices not containing any L i ...
Sensor Networks", International journal on applications of graph theory in wireless ad hoc networks and sensor networks (GRAPH-HOC), Vol.3, No.1.March ... S Mohammadi,H Jadidoleslamy - 《International Journal on Applications of Graph Theory in Wireless Ad Hoc Networks & Sensor Networks》 被...
The mathematical problem of approximating one matrix by another of lower rank is closely related to the fundamental postulate of factor-theory. When formulated as a least-squares problem, the normal equations cannot be immediately written down, since the elements of the approximate matrix are not i...