Results 31 to 40 of about 2,369,458 (297)
Weighted Domination of Independent Sets [PDF]
Graphs and Combinatorics, 2019 The {\em independent domination number} $ ^i(G)$ of a graph $G$ is the maximum, over all independent sets $I$, of the minimal number of vertices needed to dominate $I$. It is known \cite{abz} that in chordal graphs $ ^i$ is equal to $ $, the ordinary domination number.
Aharoni, Ron, Gorelik, Irina
openaire +3 more sources
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
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
Coloring and Guarding Arrangements [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 Combinatorics
Prosenjit Bose +6 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
Recoverable Values for Independent Sets [PDF]
Random Structures & Algorithms, 2011 AbstractThe notion of recoverable value was advocated in the work of Feige, Immorlica, Mirrokni and Nazerzadeh (APPROX 2009) as a measure of quality for approximation algorithms. There, this concept was applied to facility location problems. In the current work we apply a similar framework to the maximum independent set problem (MIS).
Feige, Uriel, Reichman, Daniel
openaire +2 more sources
Domination in m− polar soft fuzzy graphs
Ratio Mathematica, 2023 In this paper, we have introduced dominating set, minimal dominating set, independent dominating set, maximal independent dominating set in m − polar soft fuzzy graphs.
S Ramkumar, R Sridevi
doaj +1 more source
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
Engineering Science and Technology, an International JournalIn this study, a method has been developed for solving the maximum independent set problem, which is one of the significant problems in graph theory. The maximum independent set problem is NP-hard for all types of graphs.
Furkan Öztemiz
doaj +1 more source