Results 271 to 280 of about 390,323 (304)

On the Independence Number of Steiner Systems

Combinatorics, Probability and Computing, 2013
Apartial Steiner (n,r,l)-systemis anr-uniform hypergraph onnvertices in which every set oflvertices is contained in at most one edge. A partial Steiner (n,r,l)-system iscompleteif every set oflvertices is contained in exactly one edge. In a hypergraph, the independence number α() denotes the maximum size of a set of vertices incontaining no edge.
Alex Eustis, Jacques Verstraëte
openaire   +2 more sources

Trees with independent Roman domination number twice the independent domination number

Discrete Mathematics, Algorithms and Applications, 2015
A Roman dominating function (RDF) on a graph [Formula: see text] is a function [Formula: see text] satisfying the condition that every vertex [Formula: see text] for which [Formula: see text] is adjacent to at least one vertex [Formula: see text] for which [Formula: see text].
Mustapha Chellali, Nader Jafari Rad
openaire   +2 more sources

On the number of independent partitions

Journal of Symbolic Logic, 1985
In [3], Shelah defined the cardinals κn(T) and , for each theory T and n < ω. κn(T) is the least cardinal κ without a sequence (pi)i<κ of complete n-types such that pi is a forking extension of pj for all i < j < κ. It is essential in computing the stability spectrum of a stable theory. On the other hand is called the number of independent
openaire   +1 more source

On Domination and Independence Numbers of Graphs

Results in Mathematics, 1990
The authors characterize those graphs which (1) have equal domination and independence numbers, and (2) are either bipartite or are block graphs, i.e., graphs in which every block is a complete graph.
Topp, Jerzy, Volkmann, Lutz
openaire   +1 more source

Independent bondage number of a graph

Journal of Combinatorial Optimization, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bruce Priddy, Haiying Wang 0002, Bing Wei 0001   +2 more
openaire   +2 more sources

The Number of Independent Systems of Representatives

Journal of the London Mathematical Society, 1975
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

ON THE INDEPENDENCE NUMBERS OF COMPLEMENTARY GRAPHS

Transactions of the New York Academy of Sciences, 1974
AbstractA set of vertices (edges) is called independent if no two vertices (edges) in the set are adjacent. The independence number β(G) (edge independence number β1(G)) is the maximum number of elements in an independent set of vertices (edges) of G.
Chartrand, Gary, Schuster, Seymour
openaire   +2 more sources

Testing the Independence Number of Hypergraphs

2004
A k-uniform hypergraph G of size n is said to be e-far from having an independent set of size ρn if one must remove at least en k edges of G in order for the remaining hypergraph to have an independent set of size ρn. In this work, we present a natural property testing algorithm that distinguishes between hypergraphs which have an independent set of ...
openaire   +2 more sources

The minimum independence number for designs

Combinatorica, 1995
Let \(V\) be a set with \(n\) elements, and let \(D\) denote a collection of subsets of \(V\), each subset with \(k\) elements in it, such that every subset of \(t\) elements of \(V\) appears exactly in \(\lambda\) blocks of \(D\). Such a configuration is called \(t\)-\((n, k, \lambda)\) design and is denoted by a pair \(P= (V, D)\). If no block of \(D\
David A. Grable, Kevin T. Phelps, Vojtech Rödl   +2 more
openaire   +1 more source

On the independence number of sparse graphs

Random Structures & Algorithms, 1995
AbstractLet G be a regular graph of degree d on n points which contains no Kr (r ≥ 4). Let α be the independence number of G. Then we show for large d that α ≥ c(r)n . © 1995 John Wiley & Sons, Inc.
openaire   +1 more source