Results 11 to 20 of about 280 (99)
Mathematical Investigation of Eulerian and Hamiltonian Graphs in Complex Networks
This study investigates the properties and applications of Eulerian and Hamiltonian graphs within complex networks, with a particular focus on their roles in transportation, communication, and biological systems. The primary objective is to develop a deeper mathematical understanding of these graph structures and their implications for optimizing ...
Md Asaduzzaman
core +4 more sources
Spanning eulerian subdigraphs in semicomplete digraphs
Journal of Graph Theory, Volume 102, Issue 3, Page 578-606, March 2023., 2023 Abstract A digraph is eulerian if it is connected and every vertex has its in‐degree equal to its out‐degree. Having a spanning eulerian subdigraph is thus a weakening of having a hamiltonian cycle. In this paper, we first characterize the pairs (D,a) $(D,a)$ of a semicomplete digraph D $D$ and an arc a $a$ such that D $D$ has a spanning eulerian ...
Jørgen Bang‐Jensen +2 more
wiley +1 more source
Communications on Pure and Applied Mathematics, Volume 75, Issue 12, Page 2685-2801, December 2022., 2022 Abstract This manuscript constructs global in time solutions to master equations for potential mean field games. The study concerns a class of Lagrangians and initial data functions that are displacement convex, and so this property may be in dichotomy with the so‐called Lasry–Lions monotonicity, widely considered in the literature.
Wilfrid Gangbo, Alpár R. Mészáros
wiley +1 more source
Some Bianchi Type Viscous Holographic Dark Energy Cosmological Models in the Brans–Dicke Theory
Advances in Astronomy, Volume 2022, Issue 1, 2022., 2022 In this article, we analyze Bianchi type–II, VIII, and IX spatially homogeneous and anisotropic space‐times in the background of the Brans–Dicke theory of gravity within the framework of viscous holographic dark energy. To solve the field equations, we have used the relation between the metric potentials as R = Sn and the relation between the scalar ...
M. Vijaya Santhi +4 more
wiley +1 more source
On Hamiltonian Decomposition Problem of 3‐Arc Graphs
Computational Intelligence and Neuroscience, Volume 2022, Issue 1, 2022., 2022 A 4‐tuple (y, x, v, w) in a graph is a 3‐arc if each of (y, x, v) and (x, v, w) is a path. The 3‐arc graph of H is the graph with vertex set all arcs of H and edge set containing all edges joining xy and vw whenever (y, x, v, w) is a 3‐arc of H. A Hamilton cycle is a closed path meeting each vertex of a graph.
Guangjun Xu +3 more
wiley +1 more source
Some Properties of the Zero‐Divisor Graphs of Idealization Ring R(+)M
Mathematical Problems in Engineering, Volume 2022, Issue 1, 2022., 2022 The aim of this article to follow the properties of the zero‐divisor graph of special idealization ring. We study the wiener index of the zero‐divisors graph of some special idealization ring R(+)M and find the clique number of the graph Γ(R(+)M) is ω (Γ(R(+)M)) = |M| − 1, where R is an integral domain.
Manal Al-Labadi, Naeem Jan
wiley +1 more source
Relations and Notions amid Hamiltonicity and Eulerian Notions in Some Classes of Neutrosophic Graphs
, 2022 New setting is introduced to study Eulerian(Hamiltonian) neutrosophic path and n-Eulerian(Hamiltonian) neutrosophic path arising from finding and counting longest neutrosophic paths containing all edges (vertices) once.
Henry Garrett
core +1 more source
Wave–current interaction on a free surface
Studies in Applied Mathematics, Volume 147, Issue 4, Page 1277-1338, November 2021., 2021 Abstract The classical water wave equations (CWWEs) comprise two boundary conditions for the two‐dimensional flow on the free surface of a bulk three‐dimensional (3D) incompressible potential flow in the volume bounded by the free surface, which itself moves under the restoring force of gravity.
Dan Crisan +2 more
wiley +1 more source
Sparse Kneser graphs are Hamiltonian
Journal of the London Mathematical Society, Volume 103, Issue 4, Page 1253-1275, June 2021., 2021 Abstract For integers k⩾1 and n⩾2k+1, the Kneser graph K(n,k) is the graph whose vertices are the k‐element subsets of {1,…,n} and whose edges connect pairs of subsets that are disjoint. The Kneser graphs of the form K(2k+1,k) are also known as the odd graphs.
Torsten Mütze +2 more
wiley +1 more source
, 2013 In this paper, the concept of Total semirelib graph of a planar graph is introduced. Authors present a characterization of those graphs whose total semirelib graphs are planar, outer planar, Eulerian, hamiltonian with crossing number ...
Prasad, Manjunath +3 more
core +1 more source