Results 21 to 30 of about 166,587,123 (294)
The STEM Methodology and Graph Theory: Some Practical Examples
Mathematics, 2021 In this paper, we highlight that Graph Theory is certainly well suited to an applications approach. One of the basic problems that this theory solves is finding the shortest path between two points.
Cristina Jordán +2 more
doaj +1 more source
On some applications of graph theory, I
Discrete Mathematics, 1972 In the first and second parts of this sequence we dealt with applications of graph theory to distance distribution in certain sets in euclidean spaces, to potential theory, to estimations of the transfinite diameter [1] and to value distribution of "triangle functional " (e.g. perimeter, area of triangles) [2].
Erdős, Pál +3 more
openaire +5 more sources
An Application of Graph Theory to Additive Number Theory
European Journal of Combinatorics, 1985 It is proved that, if \({\mathfrak A ...
Noga Alon, Paul Erdös
openaire +2 more sources
Low-degree graph partitioning via local search with applications to constraint satisfaction, max cut, and coloring [PDF]
, 1997 We present practical algorithms for constructing partitions of graphs into a fixed number of vertex-disjoint subgraphs that satisfy particular degree constraints.
Magnús M. Halldórsson +3 more
core +1 more source
On (Semi, Pre, Semi-pre, b)-open subgraph
Muthanna Journal of Pure Science, 2020 Due it difficult to find applications in topological spaces, which are branches of pure mathematics. The importance of this paper is to find applications in graph theory. So, We Introduced (semi, pre, b, semi-pre)-open subgraph to graph theory.
Aiad I. Awad
doaj +1 more source
Quotient Energy of Zero Divisor Graphs And Identity Graphs
مجلة بغداد للعلوم, 2023 Consider the (p,q) simple connected graph . The sum absolute values of the spectrum of quotient matrix of a graph make up the graph's quotient energy.
M. Lalitha Kumari +2 more
doaj +1 more source
Correction to “An application of graph theory to algebra” [PDF]
Proceedings of the American Mathematical Society, 1969 PROOF. Let r' be the result of deleting e, e', and X. The theorem holds for r' by induction. Any unicursal path on r' has the form 7172 ... 7r* where each 7ri is a path starting and ending at P but not meeting P between. Clearly n is the number of edges leaving P in r, and so is the same for all paths. Let X be the path ee' from P to P in r. We get all
openaire +2 more sources
Labeling, Covering and Decomposing of Graphs — Smarandache’s Notion in Graph Theory [PDF]
, 2010 This paper surveys the applications of Smarandache’s notion to graph theory appeared in International J.Math.Combin. from Vol.1,2008 to Vol.3,2009.
Mao, Linfan, Linfan Mao
core +1 more source
On the Beta-Number of Forests with Isomorphic Components
Discussiones Mathematicae Graph Theory, 2018 The beta-number, β (G), of a graph G is defined to be either the smallest positive integer n for which there exists an injective function f : V (G) → {0, 1, . . .
Ichishima Rikio +3 more
doaj +1 more source
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