Results 41 to 50 of about 1,373,880 (187)
Connectedness of graphs and its application to connected matroids through covering-based rough sets [PDF]
, 2015 Graph theoretical ideas are highly utilized by computer science fields especially data mining. In this field, a data structure can be designed in the form of tree.
Huang, Aiping, Zhu, William
core
The Role of Graph Theory in System of Systems Engineering
IEEE Access, 2016 The world of system of systems engineering (SoSE), and consequently systems engineering, is currently being reformalized so as to provide greater functionality, integration, and extensibility into designed systems of systems (SoS).
Willie K. Harrison
doaj +1 more source
Knowledge graph analysis of particles in Japanese [PDF]
, 2005 The theory of knowledge graphs is a structuralistic theory of language. Its ontology consists of eight types of binary relationships and four types of so-called frames. The relationships connect so-called tokens, that represent semantic units.
Hoede, C.
core +1 more source
On the Edge-Connectivity of an Uncertain Random Graph
IEEE Access, 2020 Connectivity is one of the most important concepts in graph theory. When graph theory is applied to complex systems with indeterminate factors, uncertainty and randomness are two basic types of indeterminacy.
Hao Li, Hui Zhang
doaj +1 more source
Lietuvos Matematikos Rinkinys, 2010 In this paper we analyze solutions of the problems of the graph theory with computer mathematics systems MAPLE and MATHEMATICA with purpose to reveal the opportunity of the syntax of the main commands, theirs similarities and differences.
Sigita Turskienė +1 more
doaj +1 more source
Tur\'an Graphs, Stability Number, and Fibonacci Index
, 2008 The Fibonacci index of a graph is the number of its stable sets. This parameter is widely studied and has applications in chemical graph theory. In this paper, we establish tight upper bounds for the Fibonacci index in terms of the stability number and ...
A. Knopfmacher +20 more
core +1 more source
Chip-firing games on Eulerian digraphs and NP-hardness of computing the rank of a divisor on a graph
, 2015 Baker and Norine introduced a graph-theoretic analogue of the Riemann-Roch theory. A central notion in this theory is the rank of a divisor. In this paper we prove that computing the rank of a divisor on a graph is NP-hard.
Kiss, Viktor, Tóthmérész, Lilla
core +1 more source
Graph theoretic aspects of music theory [PDF]
, 2001 The cycle on twelve points is a well-known representation of the twelve pitch classes of the traditional scale. We treat a more general situation where the number of pitch classes can be different from twelve and where, moreover, other measures of ...
Althuis, T.A., Göbel, F.
core +2 more sources
Journal of Mathematics, 2021 Graph theory has provided a very useful tool, called topological index, which is a number from the graph M with the property that every graph N isomorphic to M value of a topological index must be same for both M and N.
Muhammad Irfan +4 more
doaj +1 more source
Construction of industry knowledge graph based on graph theory
大数据, 2023 China has the largest industrial scale and the most abundant industry type among the world.However, due to the influence of many factors, it is necessary to discover the blocking and breakpoints of the industrial chain, identify the stuck points, find ...
Zhenjun LI +6 more
doaj