Results 11 to 20 of about 342,995 (169)
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
Source-Independent Quantum Random Number Generation [PDF]
Physical Review X, 2016 Quantum random number generators can provide genuine randomness by appealing to the fundamental principles of quantum mechanics. In general, a physical generator contains two parts---a randomness source and its readout. The source is essential to the quality of the resulting random numbers; hence, it needs to be carefully calibrated and modeled to ...
Zhu Cao +3 more
openaire +3 more sources
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
Open Journal of Discrete Mathematics, 2015 The independence number of a graph G is the maximum cardinality among all independent sets of G. For any tree T of order n ≥ 2, it is easy to see that . In addition, if there are duplicated leaves in a tree, then these duplicated leaves are all lying in every maximum independent set.
Min-Jen Jou, Jenq-Jong Lin
openaire +2 more sources
On the signed $2$-independence number of graphs
Electronic Journal of Graph Theory and Applications, 2017 In this paper, we study the signed 2-independence number in graphs and give new sharp upper and lower bounds on the signed 2-independence number of a graph by a simple uniform approach.
S.M. Hosseini Moghaddam +3 more
doaj +1 more source
Coloring Some Finite Sets in ℝn
Discussiones Mathematicae Graph Theory, 2013 This note relates to bounds on the chromatic number χ(ℝn) of the Euclidean space, which is the minimum number of colors needed to color all the points in ℝn so that any two points at the distance 1 receive different colors. In [6] a sequence of graphs Gn
Balogh József +2 more
doaj +1 more source
Connected Domination Number and a New Invariant in Graphs with Independence Number Three [PDF]
Computer Science Journal of Moldova, 2021 Adding a connected dominating set of vertices to a graph $G$ increases its number of Hadwiger $h(G)$. Based on this obvious property in [2] we introduced a new invariant $\eta(G)$ for which $\eta(G)\leq h(G)$. We continue to study its property.
Vladimir Bercov
doaj