Results 31 to 40 of about 979,870 (292)
The Independence Number Conditions for 2-Factors of a Claw-Free Graph
Axioms, 2022 In 2014, some scholars showed that every 2-connected claw-free graph G with independence number α(G)≤3 is Hamiltonian with one exception of family of graphs.
Wanpeng Lei, Liming Xiong, Jun Yin
doaj +1 more source
Nonperturbative Effects from the Resummation of Perturbation Theory [PDF]
, 2001 Using the general argument in Borel resummation of perturbation theory that links the divergent perturbation theory to the nonperturbative effect we argue that the nonperturbative effect associated with the perturbation theory should have a branch cut ...
A.H. Mueller +27 more
core +4 more sources
Fluids, 2019 A long overdue distinction between so-called variant and invariant complex potentials is proposed here for the first time. Invariant complex potentials describe physical flows where a switch of the real and imaginary parts of the function will still ...
Aadi Khanal, Ruud Weijermars
doaj +1 more source
Low Energy Excitations in Spin Glasses from Exact Ground States [PDF]
, 2003 We investigate the nature of the low-energy, large-scale excitations in the three-dimensional Edwards-Anderson Ising spin glass with Gaussian couplings and free boundary conditions, by studying the response of the ground state to a coupling-dependent ...
A. P. Young +33 more
core +2 more sources
Branch cuts and Riemann surfaces
, 2023 The plotting of Riemann surfaces by computational software is discussed. The link between the branches of a multi-valued function $g(z)$, defined on the range of $g(z)$, and a Riemann surface, defined on the domain of $g(z)$, is emphasized. The connection between the two is clarified by defining the \textit{charisma} of the argument $z$ to the function.
openaire +2 more sources
A branch‐and‐cut algorithm for partition coloring [PDF]
Networks, 2009 AbstractLet G = (V, E, Q) be a undirected graph, where V is the set of vertices, E is the set of edges, and Q = {Q1,…,Qq} is a partition of V into q subsets. We refer to Q1,…,Qq as the components of the partition. The partition coloring problem (PCP) consists of finding a subset V′ of V with exactly one vertex from each component Q1,…,Qq and such that ...
Frota, Yuri +3 more
openaire +1 more source
The Cut Metric, Random Graphs, and Branching Processes [PDF]
Journal of Statistical Physics, 2010 53 pages; minor edits and references ...
Bollobas, B, Janson, S, Riordan, O
openaire +4 more sources
, 2012 The paper presents an O^*(1.2312^n)-time and polynomial-space algorithm for the traveling salesman problem in an n-vertex graph with maximum degree 3.
A. Bjorklund +9 more
core +1 more source
The Branch Cut and Quasi-normal Modes at Large Imaginary Frequency in Schwarzschild Space-time
, 2012 The 'retarded' Green function for fields propagating on a Schwarzschild black hole spacetime possesses a branch cut on the complex frequency plane. Classically, the branch cut is important, for example, in order to fully determine the response of the ...
Casals, Marc, Ottewill, Adrian C.
core +1 more source
Therapeutic Apheresis and Dialysis, EarlyView.ABSTRACT Objective To compare the efficacy and safety of roxarestat versus recombinant human erythropoietin (rhEPO) in the management of renal anemia in patients undergoing maintenance hemodialysis. Methods This was a prospective, open‐label, randomized controlled trial.
Lingling Chen, Junjie Zhu, Qiaonan Ge
wiley +1 more source