On the <i>k</i>-independence number of graph products
نویسندگان
چکیده
منابع مشابه
On the chromatic number and independence number of hypergraph products
The hypergraph product G2H has vertex set V (G) × V (H), and edge set {e × f : e ∈ E(G), f ∈ E(H)}, where × denotes the usual cartesian product of sets. We construct a hypergraph sequence {Gn} for with χ(Gn) → ∞ and χ(Gn2Gn) = 2 for all n. This disproves a conjecture of Berge and Simonovits [2]. On the other hand, we show that if G and H are hypergraphs with infinite chromatic number, then the ...
متن کاملA lower bound on the independence number of a graph
For a connected and non-complete graph, a new lower bound on its independence number is proved. It is shown that this bound is realizable by the well known efficient algorithm MIN.
متن کاملInverse Independence Number of a Graph
The concept of inverse domination was introduced by Kulli V.R. and Sigarakanti S.C. [9] . Let D be a set of G. A dominating set D1 VD is called an inverse dominating set of G with respect to D. The inverse domination number (G) is the order of a smallest inverse dominating set. Motivated by this definition we define another parameter as follows. Let D be a maximum independent set in G. ...
متن کاملDomatic Number of Graph Products
A partition of V (G), all of whose classes are dominating sets in G, is called a domatic partition of G. The maximum number of classes of a domatic partition of G is called the domatic number of G. The concept of a domatic number was introduced in [1]. More interesting results on domatically full graphs, domatically critical, domatically cocritical graphs and other domatic numbers can be found ...
متن کاملBurning Number of Graph Products
Graph burning is a deterministic discrete time graph process that can be interpreted as a model for the spread of influence in social networks. The burning number of a graph is the minimum number of steps in a graph burning process for that graph. In this paper, we consider the burning number of graph products. We find some general bounds on the burning number of the Cartesian product and the s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae Graph Theory
سال: 2022
ISSN: ['1234-3099', '2083-5892']
DOI: https://doi.org/10.7151/dmgt.2480