Results 41 to 50 of about 1,660,013 (253)

Stability for Vertex Cycle Covers

open access: yesThe Electronic Journal of Combinatorics, 2017
In 1996 Kouider and Lonc proved the following natural generalization of Dirac's Theorem: for any integer $k\geq 2$, if $G$ is an $n$-vertex graph with minimum degree at least $n/k$, then there are $k-1$ cycles in $G$ that together cover all the vertices.This is tight in the sense that there are $n$-vertex graphs that have minimum degree $n/k-1$ and ...
József Balogh   +2 more
openaire   +3 more sources

Distributed Vertex Cover Reconfiguration

open access: yesCoRR, 2021
Reconfiguration schedules, i.e., sequences that gradually transform one solution of a problem to another while always maintaining feasibility, have been extensively studied. Most research has dealt with the decision problem of whether a reconfiguration schedule exists, and the complexity of finding one.
Keren Censor-Hillel   +3 more
openaire   +6 more sources

The Connected Vertex Cover in Graphs

open access: yesTheory and Applications of Graphs
This paper presents tight bounds and characterizations for the vertex cover number and the connected vertex cover number of graphs. In particular, we identify all graphs for which βc(G) = |V (G)| − 1, proving that these are exactly the cycles and ...
Kamran Mirasheh   +2 more
doaj   +1 more source

Vertex covering with capacitated trees

open access: yesNetworks, 2022
AbstractThe covering of a graph with (possibly disjoint) connected subgraphs is a fundamental problem in graph theory. In this paper, we study a version to cover a graph's vertices by connected subgraphs subject to lower and upper weight bounds, and propose a column generation approach to dynamically generate feasible and promising subgraphs. Our focus
Ralf Borndörfer   +2 more
openaire   +2 more sources

The distinguishing number and the distinguishing index of line and graphoidal graph(s)

open access: yesAKCE International Journal of Graphs and Combinatorics, 2020
The distinguishing number (index) () of a graph is the least integer such that has a vertex labeling (edge labeling) with labels that is preserved only by a trivial automorphism.
Saeid Alikhani, Samaneh Soltani
doaj   +1 more source

Some Algorithmic Results for Eternal Vertex Cover Problem in Graphs

open access: yesJournal of Graph Algorithms and Applications
The eternal vertex cover problem is a variant of the vertex cover problem. It is a two-player (attacker and defender) game in which, given a graph $G=(V,E)$, the defender needs to allocate guards at some vertices so that the allocated vertices form a ...
Kaustav Paul, Arti Pandey
doaj   +1 more source

Association Between Motor Pathway Damage and Motor Deficit in Upper and Lower Limb in People With MS

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Corticospinal tract damage is common in people with MS, but the degree of clinical symptoms varies. We hypothesize that corticospinal tract lesions are more extensive and severe in people with MS with motor impairments in both upper and lower limbs.
Mathilde Liffran   +13 more
wiley   +1 more source

An Optimized Topology Discovery Mechanism in Software Defined Networks

open access: yesJournal of Harbin University of Science and Technology, 2022
Aiming at the problems of excessive resource consumption and low operating efficiency in the topology discovery mechanism in Software Defined Networks (SDN), a stronger topology discovery mechanism (S-OFDP) is proposed.
LI Lan-ying, WANG Min, ZHU Su-xia
doaj   +1 more source

Controlling Grain Growth in Powder Bed Fusion of Yttria‐Stabilized Zirconia Using Femtosecond Lasers: Challenges and Methodological Insights

open access: yesAdvanced Engineering Materials, EarlyView.
Binder‐free laser powder bed fusion of 8YSZ with a femtosecond laser is used to map process windows linking scan strategy, heat accumulation, and grain growth. Time‐resolved thermography and simulations reveal thermal regimes that enable continuous, vitrified, and fine‐grained 8YSZ surface layers without absorptive additives and demonstrate ...
Markus Kühn   +5 more
wiley   +1 more source

Vertex-Mean Graphs [PDF]

open access: yes, 2011
A graph that has a Smarandachely vertex-mean k-labeling is called Smarandachely k vertex-mean graph or Smarandachely k V -mean graph. Particularly, if k = 0, such a Smarandachely vertex-mean 0-labeling and Smarandachely 0 vertex-mean graph or ...
Lourdusamy, A., Seenivasan, M.
core   +1 more source

Home - About - Disclaimer - Privacy