Results 21 to 30 of about 280 (99)
AIChE Journal, Volume 67, Issue 3, March 2021., 2021 Abstract Research problems in the domains of physical, engineering, biological sciences often span multiple time and length scales, owing to the complexity of information transfer underlying mechanisms. Multiscale modeling (MSM) and high‐performance computing (HPC) have emerged as indispensable tools for tackling such complex problems.
Ravi Radhakrishnan
wiley +1 more source
Journal of Graph Theory, Volume 96, Issue 2, Page 269-288, February 2021., 2021 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.
Behrooz Bagheri Gh +3 more
wiley +1 more source
Connecting graphs with R-hypermodules via normal fuzzy subhypermodules [PDF]
Journal of HyperstructuresIn this paper, we analyze the connection between R-hypermodules and graphs by associating a graph with an R- hypermodule through a normal fuzzy subhypermodule.
Fatemeh Niyazi +2 more
doaj +1 more source
Hamiltonian problems in edge-colored complete graphs and eulerian cycles in edge-colored graphs : some complexity results [PDF]
RAIRO - Operations Research, 1996 Summary: In an edge-colored graph, we say that a path (cycle) is alternating if it has length at least 2 (3) and if any 2 adjacent edges of this path (cycle) have different colors. We give efficient algorithms for finding alternating factors with a minimum number of cycles and then, by using this result, we obtain polynomial algorithms for finding ...
Benkouar, A. +3 more
openaire +2 more sources
Group Colorability and Hamiltonian Properties of Graphs [PDF]
, 2011 The research of my dissertation was motivated by the conjecture of Thomassen that every 4-connected line graph is hamiltonian and by the conjecture of Matthews and Sumner that every 4-connected claw-free graph is hamiltonian. Towards the hamiltonian line
Li, Hao
core +1 more source
Fuzzy Eulerian and Fuzzy Hamiltonian Graphs with Their Applications
International Journal of Recent Technology and Engineering (IJRTE), 2019 In this article we discussed prominence of Fuzzy Eulerian and Fuzzy Hamiltonian graphs. Fuzzy logic is introduced to study the uncertainty of the event. In Fuzzy set theory we assign a membership value to each element of the set which ranges from 0 to 1. The earnest efforts of the researchers are perceivable in the relevant establishment of the subject
Abdul. Muneera +2 more
openaire +1 more source
The Hamiltonian index of graphs [PDF]
, 2009 The Hamiltonian index of a graph G is defined as h ( G ) = min { m : L m ( G ) is Hamiltonian } . In this paper, using the reduction method of Catlin [P.A. Catlin, A reduction method to find spanning Eulerian subgraphs, J.
Tao, Zhi-Sui +3 more
core +1 more source
Eulerian subgraphs and Hamiltonicity of claw -free graphs [PDF]
, 2003 Let C(l, k) denote the class of 2-edge-connected graphs of order n such that a graph G ∈ C(l, k) if and only if for every edge cut S ⊆ E(G) with |S| ≤ 3, each component of G - S has order at least n-kl .
Zhan, Mingquan
core +1 more source
Scaling turbulence drives the general circulation
Quarterly Journal of the Royal Meteorological Society, Volume 152, Issue 780, October 2026 Part A.The NOAA Gulfstream SP4, which deployed the GPS dropsondes over the NE Pacific Ocean as part of the Winter Storms Project during the January–March periods of 2004, 2005 and 2006. Abstract Statistical multifractal analysis of airborne and dropsonde observations is used to show that persistence of velocity after molecular collisions breaks the continuous
Adrian F. Tuck
wiley +1 more source
Pairwise display of high dimensional information via Eulerian tours and Hamiltonian decompositions [PDF]
, 2010 A graph theoretic approach is taken to the component order problem in the layout of statistical graphics. Eulerian tours and Hamiltonian decompositions of complete graphs are used to ameliorate order effects in statistical graphics.
C. B. Hurley +3 more
core +1 more source