Results 31 to 40 of about 17,874 (261)

Generalization of the Cover Pebbling Number for Networks

Frontiers in Physics, 2020
Pebbling can be viewed as a model of resource transportation for networks. We use a graph to denote the network. A pebbling move on a graph consists of the removal of two pebbles from a vertex and the placement of one pebble on an adjacent vertex.
Zheng-Jiang Xia, Zhen-Mu Hong
doaj   +1 more source

Stability for Vertex Cycle Covers

The 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, Frank Mousset, Jozef Skokan   +2 more
openaire   +2 more sources

Distributed Vertex Cover Reconfiguration

CoRR, 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, Yannic Maus, Shahar Romem Peled, Tigran Tonoyan   +3 more
openaire   +4 more sources

Dynamic monopolies in simple graphs [PDF]

AUT Journal of Mathematics and Computing
This paper studies a repetitive polling game played on an $n$-vertex graph $G$. At first, each vertex is colored, Black or White. At each round, each vertex (simultaneously) recolors itself by the color of the majority of its closed neighborhood.
Leila Musavizadeh Jazaeri, Leila Sharifan   +1 more
doaj   +1 more source

Vertex covering with capacitated trees

Networks, 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, Stephan Schwartz, William Surau   +2 more
openaire   +2 more sources

The Connected Vertex Cover in Graphs

Theory 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, Elham Mirashe, Ebrahim Vatandoost   +2 more
doaj   +1 more source

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

AKCE 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

Journal 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

Combinatorial Dominance Guarantees for Heuristic Algorithms [PDF]

Discrete Mathematics & Theoretical Computer Science, 2007
An $f(n)$ $\textit{dominance bound}$ on a heuristic for some problem is a guarantee that the heuristic always returns a solution not worse than at least $f(n)$ solutions.
Daniel Berend, Steven S. Skiena, Yochai Twitto   +2 more
doaj   +1 more source

An Optimized Topology Discovery Mechanism in Software Defined Networks

Journal 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