Results 31 to 40 of about 8,249,666 (288)
Making a Dominating Set of a Graph Connected
Discussiones Mathematicae Graph Theory, 2018 Let G = (V,E) be a graph and S ⊆ V. We say that S is a dominating set of G, if each vertex in V \ S has a neighbor in S. Moreover, we say that S is a connected (respectively, 2-edge connected or 2-connected) dominating set of G if G[S] is connected ...
Li Hengzhe, Wu Baoyindureng, Yang Weihua
doaj +1 more source
Minimum Neighborhood of Alternating Group Graphs
IEEE Access, 2019 The minimum neighborhood and combinatorial property are two important indicators of fault tolerance of a multiprocessor system. Given a graph G, θG(q) is the minimum number of vertices adjacent to a set of q vertices of G (1 ≤ q ≤ |V(
Yanze Huang +3 more
doaj +1 more source
Quantum Algorithm for Approximating Maximum Independent Sets
, 2021 We present a quantum algorithm for approximating maximum independent sets of a graph based on quantum non-Abelian adiabatic mixing in the sub-Hilbert space of degenerate ground states, which generates quantum annealing in a secondary Hamiltonian.
Wilczek, Frank, Wu, Biao, Yu, Hongye
core +1 more source
Application of an Extremal Result of Erdős and Gallai to the (n,k,t) Problem
Theory and Applications of Graphs, 2017 An extremal result about vertex covers, attributed by Hajnal to Erdős and Gallai, is applied to prove the following: If n, k, and t are integers satisfying n ≥ k ≥ t ≥ 3 and k ≤ 2t - 2, and G is a graph with the minimum number of edges among graphs on n ...
Matt Noble +3 more
doaj +1 more source
Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack [PDF]
, 2019 The area of parameterized approximation seeks to combine approximation and parameterized algorithms to obtain, e.g., (1+epsilon)-approximations in f(k,epsilon)n^O(1) time where k is some parameter of the input.
Grandoni, Fabrizio +2 more
core +2 more sources
Counting Maximal Distance-Independent Sets in Grid Graphs
Discussiones Mathematicae Graph Theory, 2013 Previous work on counting maximal independent sets for paths and certain 2-dimensional grids is extended in two directions: 3-dimensional grid graphs are included and, for some/any ℓ ∈ N, maximal distance-ℓ independent (or simply: maximal ℓ-independent ...
Euler Reinhardt +2 more
doaj +1 more source
On the independent set interdiction problem
Electronic Journal of Graph Theory and Applications, 2015 The purpose of the independent set interdiction problem in the weighted graph $G$ is to determine a set of vertices $R^*$ such that the weight of the maximum independent set in $G-R^*$ is minimized.
Gholam Hassan Shirdel, Nasrin Kahkeshani
doaj +1 more source
Inapproximability of the independent set polynomial in the complex plane
, 2020 We study the complexity of approximating the independent set polynomial $Z_G(\lambda)$ of a graph $G$ with maximum degree $\Delta$ when the activity $\lambda$ is a complex number.
Bezakova, Ivona +3 more
core +1 more source
Coloring and Guarding Arrangements [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 Combinatorics
Prosenjit Bose +6 more
doaj +1 more source
Representational capacity of a set of independent neurons
, 2001 The capacity with which a system of independent neuron-like units represents a given set of stimuli is studied by calculating the mutual information between the stimuli and the neural responses.
A. Treves +21 more
core +1 more source