Results 41 to 50 of about 165,258 (315)
IEEE Access, 2021 This paper presents a novel travelling wave-based placement strategy and fault detection scheme to locate faults on complex power grids. A fault occurring on a power grid results in travelling waves propagating from the fault location towards detectors ...
Elizabeth C. M. Maritz +2 more
doaj +1 more source
Kernelization and Parameterized Algorithms for 3-Path Vertex Cover
, 2016 A 3-path vertex cover in a graph is a vertex subset $C$ such that every path of three vertices contains at least one vertex from $C$. The parameterized 3-path vertex cover problem asks whether a graph has a 3-path vertex cover of size at most $k$.
B Brešar +24 more
core +1 more source
Vertex cover problem studied by cavity method: Analytics and population dynamics
, 2003 We study the vertex cover problem on finite connectivity random graphs by zero-temperature cavity method. The minimum vertex cover corresponds to the ground state(s) of a proposed Ising spin model.
Zhou, Haijun
core +2 more sources
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 ...
Balogh, József +2 more
openaire +3 more sources
Wasit Journal for Pure Sciences, 2023 In this paper, we presented a new properties of a weakly completely prime graph, where we added the algebraic properties in this graph and extracted from them some important theories and results, with the study of homomorphism in this graph when ...
ameer al-swidi, Ahmed A.Omran
doaj +1 more source
Some Graph Polynomials of the Power Graph and its Supergraphs [PDF]
Mathematics Interdisciplinary Research, 2020 In this paper, exact formulas for the dependence, independence, vertex cover and clique polynomials of the power graph and its supergraphs for certain finite groups are presented.
Asma Hamzeh
doaj +1 more source
Identifying Vertex Covers in Graphs
The Electronic Journal of Combinatorics, 2012 An identifying vertex cover in a graph $G$ is a subset $T$ of vertices in $G$ that has a nonempty intersection with every edge of $G$ such that $T$ distinguishes the edges, that is, $e \cap T \ne \emptyset$ for every edge $e$ in $G$ and $e \cap T \ne f \cap T$ for every two distinct edges $e$ and $f$ in $G$.
Henning, Michael A., Yeo, Anders
openaire +2 more sources
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
TREEWIDTH and PATHWIDTH parameterized by vertex cover
, 2013 After the number of vertices, Vertex Cover is the largest of the classical graph parameters and has more and more frequently been used as a separate parameter in parameterized problems, including problems that are not directly related to the Vertex Cover.
Chapelle, Mathieu +3 more
core +3 more sources
Statistical Mechanics of the Hyper Vertex Cover Problem
, 2007 We introduce and study a new optimization problem called Hyper Vertex Cover. This problem is a generalization of the standard vertex cover to hypergraphs: one seeks a configuration of particles with minimal density such that every hyperedge of the ...
H. Q. Ngo +8 more
core +2 more sources