Results 51 to 60 of about 142,209 (249)
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 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
Minimum Vertex Cover in Rectangle Graphs [PDF]
Computational Geometry, 2010 We consider the Vertex Cover problem in intersection graphs of axis-parallel rectangles on the plane. We present two algorithms: The first is an EPTAS for non-crossing rectangle families, rectangle families $\calR$ where $R_1 \setminus R_2$ is connected for every pair of rectangles $R_1,R_2 \in \calR$.
Danny Hermelin +2 more
openaire +3 more sources
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
On A Class of Vertex Cover Ideals
Annals of the Alexandru Ioan Cuza University - Mathematics, 2015 Abstract We investigate vertex cover ideals associated to a significative class of connected graphs. These ideals are stated to be Cohen-Macaulay and, using the notion of linear quotients, standard algebraic invariants for them are computed.
IMBESI, Maurizio, LA BARBIERA, MONICA
openaire +4 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
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
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
Reducing the rank of a matroid [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 We consider the rank reduction problem for matroids: Given a matroid $M$ and an integer $k$, find a minimum size subset of elements of $M$ whose removal reduces the rank of $M$ by at least $k$. When $M$ is a graphical matroid this problem is the minimum $
Gwenaël Joret, Adrian Vetta
doaj +1 more source
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