Results 21 to 30 of about 390,323 (304)
A lower bound on the independence number of a graph in terms of degrees [PDF]
, 2006 For a connected and non-complete graph, a new lower bound on its independence number is proved.
Harant, Jochen, Schiermeyer, Ingo
core +1 more source
Shor’s bounds for the weighted independence number
Науковий вісник Ужгородського університету. Серія: Математика і інформатика, 2019 Application of a technique of dual Lagrangian quadratic bounds of N.Z. Shor to studying the Maximum Weighted Independent Set problem is described. By the technique, two such N.Z. Shor’s upper bounds are obtained.
П. І. Стецюк +1 more
doaj +1 more source
On the k-Component Independence Number of a Tree
Discrete Dynamics in Nature and Society, 2021 Let G be a graph and k≥1 be an integer. A subset S of vertices in a graph G is called a k-component independent set of G if each component of GS has order at most k.
Shuting Cheng, Baoyindureng Wu
doaj +1 more source
On the Independence Number of Cayley Digraphs of Clifford Semigroups
Mathematics, 2023 Let S be a Clifford semigroup and A a subset of S. We write Cay(S,A) for the Cayley digraph of a Clifford semigroup S relative to A. The (weak, path, weak path) independence number of a graph is the maximum cardinality of an (weakly, path, weakly path ...
Krittawit Limkul, Sayan Panma
doaj +1 more source
On the independence numbers of a matroid
Journal of Combinatorial Theory, Series B, 1989 Given a finite subset E of a vector space of dimension 4. The number of k-independent subsets of E will be denoted by \(I_ k\). We prove that k \(I^ 2_ k\geq (k+1)I_{k-1}I_{k+1}+I_{k-1}I_ k\). The equality holds if and only if all 4-subsets of E are independent. We prove this relation for matroids of rank 4. In particular we prove Mason's conjecture on
Yahya Ould Hamidoune, Isabelle Salaün
openaire +2 more sources
The fractional chromatic number of triangle-free subcubic graphs [PDF]
, 2014 Heckman and Thomas conjectured that the fractional chromatic number of any triangle-free subcubic graph is at most 14 / 5. Improving on estimates of Hatami and Zhu and of Lu and Peng, we prove that the fractional chromatic number of any triangle-free ...
Král’, Daniel +5 more
core +1 more source
Further Results on Packing Related Parameters in Graphs
Discussiones Mathematicae Graph Theory, 2022 Given a graph G = (V, E), a set B ⊆ V (G) is a packing in G if the closed neighborhoods of every pair of distinct vertices in B are pairwise disjoint. The packing number ρ(G) of G is the maximum cardinality of a packing in G. Similarly, open packing sets
Mojdeh Doost Ali +2 more
doaj +1 more source
Semi Square Stable Graphs and Efficient Dominating Sets [PDF]
Transactions on Combinatorics, 2023 A graph $G$ is called semi square stable if $\alpha (G^{2})=i(G)$ where $%\alpha (G^{2})$ is the independence number of $G^{2}$ and $i(G)$ is the independent dominating number of $G$.
Baha̓ Abughazaleh, Omar Abughneim
doaj +1 more source
On the $k$-independence number of graphs
Discret. Math., 2018 © 2019. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/
Abiad, Aida +2 more
openaire +4 more sources
Computing Tree Decompositions with Small Independence Number [PDF]
The independence number of a tree decomposition is the maximum of the independence numbers of the subgraphs induced by its bags. The tree-independence number of a graph is the minimum independence number of a tree decomposition of it.
Fomin, Fedor V. +4 more
core +3 more sources