Results 11 to 20 of about 183 (122)
On Hamiltonian Decomposition Problem of 3-Arc Graphs. [PDF]
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.
Xu G, Sun Q, Liang Z.
europepmc +2 more sources
Hamiltonian cycles in planar cubic graphs with facial 2-factors, and a new partial solution of Barnette's Conjecture. [PDF]
Abstract We study the existence of hamiltonian cycles in plane cubic graphs G having a facial 2‐factor Q. Thus hamiltonicity in G is transformed into the existence of a (quasi) spanning tree of faces in the contraction G ∕ Q. In particular, we study the case where G is the leapfrog extension (called vertex envelope of a plane cubic graph G 0.
Bagheri Gh B +3 more
europepmc +2 more sources
SOME PROPERTIES ON COPRIME GRAPH OF GENERALIZED QUATERNION GROUPS
A coprime graph is a representation of finite groups on graphs by defining the vertex graph as an element in a group and two vertices adjacent to each other's if and only if the order of the two elements is coprime.
Arif Munandar
doaj +1 more source
Notes on upper bounds for the largest eigenvalue based on edge-decompositions of a signed graph
The adjacency matrix of a signed graph has +1 or -1 for adjacent vertices, depending on the sign of the connecting edge. According to this concept, an ordinary graph can be interpreted as a signed graph without negative edges.
Zoran Stanić
doaj +1 more source
Fuzzy Topological Topographic Mapping (FTTM) is a mathematical model that consists of a set of homeomorphic topological spaces designed to solve the neuro magnetic inverse problem.
Noorsufia Abd Shukor +4 more
doaj +1 more source
Spanning eulerian subdigraphs in semicomplete digraphs
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
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
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
Some Properties of the Zero‐Divisor Graphs of Idealization Ring R(+)M
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
Wave–current interaction on a free surface
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

