Results 31 to 40 of about 983,866 (300)
Independent sets in (P₆, diamond)-free graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 Graphs and ...
Raffaele Mosca
doaj +1 more source
Theoretical Computer Science, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Magnús M. Halldórsson +3 more
openaire +1 more source
?-Independent and Dissociate Sets on Compact Commutative Strong Hypergroups [PDF]
Journal of Sciences, Islamic Republic of Iran, 2008 In this paper we define ?-independent (a weak-version of independence), Kronecker and dissociate sets on hypergroups and study their properties and relationships among them and some other thin sets such as independent and Sidon sets.
doaj +2 more sources
Independent sets of maximum weight in apple-free graphs [PDF]
, 2010 We present the first polynomial-time algorithm to solve the maximum weight independent set problem for apple-free graphs, which is a common generalization of several important classes where the problem can be solved efficiently, such as claw-free graphs,
Lozin, Vadim V. +2 more
core +1 more source
Computing Independent Variable Sets for Polynomial Ideals
Journal of Mathematics, 2022 Computing independent variable sets for polynomial ideals plays an important role in solving high-dimensional polynomial equations. The computation of a Gröbner basis for an ideal, with respect to a block lexicographical order in classic methods, is huge,
Zhuoran Yang, Chang Tan
doaj +1 more source
On independent star sets in finite graphs [PDF]
, 2014 Let G be a finite graph with μ as an eigenvalue of multiplicity k. A star set for μ is a set X of k vertices in G such that μ is not an eigenvalue of G-X. We investigate independent star sets of largest possible size in a variety of situations.
Rowlinson, Peter
core +1 more source
Counting independent sets in strongly orderable graphs [PDF]
, 2021 We consider the problem of devising algorithms to count exactly the number of independent sets of a graph G . We show that there is a polynomial time algorithm for this problem when G is restricted to the class of strongly orderable graphs, a superclass ...
Müller, H, Heinrich, M
core +1 more source
Discrete Applied Mathematics, 2016 The regular independence number, introduced by Albertson and Boutin in 1990, is the size of a largest set of independent vertices with the same degree. Lower bounds were proven for this invariant, in terms of the order, for trees and planar graphs.
Yair Caro, Adriana Hansberg, Ryan Pepper
openaire +3 more sources
Systems of conditionally independent sets [PDF]
, 2017 The concept of conditionally independent sets is introduced in this article. Its link with the concept of the conditional probability and with the concept of a system of independent sets is described here.
Monika Jahodová +3 more
core +1 more source
Independent Sets in Polarity Graphs [PDF]
SIAM Journal on Discrete Mathematics, 2016 Given a projective plane $Σ$ and a polarity $θ$ of $Σ$, the corresponding polarity graph is the graph whose vertices are the points of $Σ$, and two distinct points $p_1$ and $p_2$ are adjacent if $p_1$ is incident to $p_2^{ θ}$ in $Σ$. A well-known example of a polarity graph is the Erdős-Rényi orthogonal polarity graph $ER_q$, which appears frequently
Michael Tait, Craig Timmons
openaire +3 more sources