Results 101 to 110 of about 841,975 (192)

Fuzzy soft cycles in Fuzzy soft graphs

Journal of New Results in Science, 2019
Fuzzy soft settheory is one among many topics which has been developed recently for dealingwith uncertainties. In this paper, decomposition of complete fuzzy soft graphsinto Hamiltonian fuzzy soft cycles is proposed and related properties arestudied ...
Shashikala S, Anil P N
doaj  

On disjoint hamiltonian cycles in bipartite graphs

, 2014
This paper is an exposition about the article written by Ferrara, Gould, Tansey and Whalen entitled Disjoint hamiltonian cycles in bipartite graphs which appeared on Discrete Mathematics vol. 309 (2009).
Enriquez, Juan Carlos V., Briones, Ryan Louise M.   +1 more
core  

Hamiltonian cycles in subdivided doubles

Ars Mathematica Contemporanea
The subdivided double construction on 4-regular graphs was used by Potočnik and Wilson to explore semi-symmetric (edge-transitive but not vertex-transitive) graphs, and can be used to construct every semi-symmetric 4-regular graph that contains a pair of twin vertices.
openaire   +2 more sources

A feasible probability and graph model for memory engrams. [PDF]

Front Comput Neurosci
Wei H, Yang S, Li Y.
europepmc   +1 more source

Advancing practical quantum embedding simulations <i>via</i> operator commutativity-based state preparation for complex chemical systems. [PDF]

Chem Sci
Mondal D, Patra AK, Maitra R.
europepmc   +1 more source

Quantum dynamics in frustrated Ising fullerenes. [PDF]

EPJ Quantum Technol
Lopez-Bezanilla A, Bernoudy W, Boothby K, Raymond J, Nocera A, King AD.   +5 more
europepmc   +1 more source

Spin-Based Quantum Energy Devices: From Quantum Thermal Machines to Quantum Batteries. [PDF]

Entropy (Basel)
Chand S, Grazi R, Traverso Ziani N, Ferraro D.   +3 more
europepmc   +1 more source

Robust topological temperature localization in thermal rock-paper-scissors chain. [PDF]

Natl Sci Rev
Wang Z, Liu Q, Qian X, Luo X, Hu R.
europepmc   +1 more source

On Hamiltonian Cycles in Trees

, 1998
We present a simple algorithm for constructing Hamiltonian cycles on trees together with additional edges between leaves, compute the number of such additional edges required for complete k-ary trees of given depth, show this number is minimal over all ...
Shao Dong Chen, Hong Shen, Rodney Topor
core  

Energy Transfer Pathways in Plant Photosystem I from First-Principles Modeling. [PDF]

JACS Au
Betti E, Cupellini L.
europepmc   +1 more source