Disjoint cycles and 2-factors with Fan-type condition in a graph

2022 ◽  
Vol 345 (4) ◽  
pp. 112789
Author(s):  
Jie Zhang ◽  
Jin Yan
Keyword(s):  
Type Condition ◽  
Disjoint Cycles

Fan-type condition on disjoint cycles in a graph

2018 ◽  
Vol 341 (4) ◽  
pp. 1160-1165 ◽  
Author(s):  
Jin Yan ◽  
Shaohua Zhang ◽  
Junqing Cai
Keyword(s):  
Type Condition ◽  
Disjoint Cycles

scholarly journals An Ore-type condition for the existence of two disjoint cycles

2020 ◽  
Vol 159-160 ◽  
pp. 105957
Author(s):  
Maoqun Wang ◽  
Jianguo Qian
Keyword(s):  
Type Condition ◽  
Disjoint Cycles

scholarly journals Mixed metric dimension of graphs with edge disjoint cycles

2021 ◽  
Vol 300 ◽  
pp. 1-8
Author(s):  
Jelena Sedlar ◽  
Riste Škrekovski
Keyword(s):  
Metric Dimension ◽  
Edge Disjoint ◽  
Disjoint Cycles ◽  
Mixed Metric

scholarly journals A fast $$(2 + \frac{2}{7})$$-approximation algorithm for capacitated cycle covering

2021 ◽  
Author(s):  
Vera Traub ◽  
Thorben Tröbst
Keyword(s):  
Vehicle Routing Problem ◽  
Covering Problem ◽  
Post Processing ◽  
Routing Problem ◽  
Cycle Cover ◽  
Disjoint Cycles ◽  
Processing Step ◽  
Number Of Cycles ◽  
Vertex Disjoint ◽  
Capacitated Vehicle

AbstractWe consider the capacitated cycle covering problem: given an undirected, complete graph G with metric edge lengths and demands on the vertices, we want to cover the vertices with vertex-disjoint cycles, each serving a demand of at most one. The objective is to minimize a linear combination of the total length and the number of cycles. This problem is closely related to the capacitated vehicle routing problem (CVRP) and other cycle cover problems such as min-max cycle cover and bounded cycle cover. We show that a greedy algorithm followed by a post-processing step yields a $$(2 + \frac{2}{7})$$ ( 2 + 2 7 ) -approximation for this problem by comparing the solution to a polymatroid relaxation. We also show that the analysis of our algorithm is tight and provide a $$2 + \epsilon $$ 2 + ϵ lower bound for the relaxation.

scholarly journals Unified multivalued interpolative Reich–Rus–Ćirić-type contractions

2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Monairah Alansari ◽  
Muhammad Usman Ali
Keyword(s):  
Fixed Point ◽  
Type Condition ◽  
Multivalued Maps ◽  
Contraction Type ◽  
Type Contraction

AbstractThis article examines new multivalued interpolative Reich–Rus–Ćirić-type contraction conditions and fixed point results for multivalued maps that fulfill these conditions. Earlier defined interpolative contraction type conditions cannot be particularized to any contraction type condition. This slackness of the interpolative contraction type condition is addressed through new multivalued interpolative Reich–Rus–Ćirić-type contraction conditions.

Heat equation with singular potential and singular data

2005 ◽  
Vol 135 (4) ◽  
pp. 863-886 ◽  
Author(s):  
M. Nedeljkov ◽  
S. Pilipović ◽  
D. Rajter-Ćirić
Keyword(s):  
Polynomial Growth ◽  
Singular Potential ◽  
Function Algebra ◽  
Energy Estimates ◽  
Generalized Function ◽  
Type Condition ◽  
Classical Energy ◽  
The Cauchy Problem ◽  
White Noise Calculus ◽  
Singular Data

Nets of Schrödinger C0-semigroups (Sε)ε with the polynomial growth with respect to ε are used for solving the Cauchy problem (∂t − Δ)U + VU = f(t, U), U(0, x) = U0(x) in a suitable generalized function algebra (or space), where V and U0 are singular generalized functions while f satisfies a Lipschitz-type condition. The existence of distribution solutions is proved in appropriate cases by the means of white noise calculus as well as classical energy estimates.

scholarly journals Packing disjoint cycles over vertex cuts

2010 ◽  
Vol 310 (13-14) ◽  
pp. 1974-1978 ◽  
Author(s):  
Jochen Harant ◽  
Dieter Rautenbach ◽  
Peter Recht ◽  
Ingo Schiermeyer ◽  
Eva-Maria Sprengel
Keyword(s):  
Disjoint Cycles
Sign in / Sign up

Export Citation Format

Share Document