Results 271 to 280 of about 9,407,399 (300)

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   +3 more sources

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

The average distance and the independence number

Journal of Graph Theory, 1988
AbstractWe prove that in every connected graph the independence number is at least as large as the average distance between vertices.
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

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

Independence number and clique minors

Journal of Graph Theory, 2007
AbstractThe Hadwiger number ${h}({G})$ of a graph G is the maximum integer t such that ${K}_{t}$ is a minor of G. Since $\chi({G})\cdot\alpha({G})\geq |{G}|$, Hadwiger's conjecture implies that ${h}({G})\cdot \alpha({G})\geq |{G}|$, where $\alpha({G})$ and $|{G}|$ denote the independence number and the number of vertices of G, respectively.
Kawarabayashi, Ken Ichi, Song, Zi Xia
openaire   +3 more sources

Complete Minors and Independence Number

SIAM Journal on Discrete Mathematics, 2010
Let $G$ be a graph with $n$ vertices and independence number $\alpha$. Hadwiger's conjecture implies that $G$ contains a clique minor of order at least $n/\alpha$. In 1982, Duchet and Meyniel proved that this bound holds within a factor 2. Our main result gives the first improvement on their bound by an absolute constant factor.
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

Estimates of the number of independent sets in graphs with a fixed independence number

Moscow University Computational Mathematics and Cybernetics, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Drug independence and the curability of cancer by combination chemotherapy

Trends in Cancer, 2022
Adam Palmer, Amy Pomeroy, Peter K Sorger   +2 more
exaly