54 research outputs found
FROM IRREDUNDANCE TO ANNIHILATION: A BRIEF OVERVIEW OF SOME DOMINATION PARAMETERS OF GRAPHS
Durante los últimos treinta años, el concepto de dominación en grafos ha levantado un interés impresionante. Una bibliografÃa reciente sobre el tópico contiene más de 1200 referencias y el número de definiciones nuevas está creciendo continuamente. En vez de intentar dar un catálogo de todas ellas, examinamos las nociones más clásicas e importantes (tales como dominación independiente, dominación irredundante, k-cubrimientos, conjuntos k-dominantes, conjuntos Vecindad Perfecta, ...) y algunos de los resultados más significativos.  PALABRAS CLAVES: TeorÃa de grafos, Dominación.  ABSTRACT During the last thirty years, the concept of domination in graphs has generated an impressive interest. A recent bibliography on the subject contains more than 1200 references and the number of new definitions is continually increasing. Rather than trying to give a catalogue of all of them, we survey the most classical and important notions (as independent domination, irredundant domination, k-coverings, k-dominating sets, Perfect Neighborhood sets, ...) and some of the most significant results.  KEY WORDS: Graph theory, Domination
On the bipartite independence number of a balanced bipartite graph
AbstractThe bipartite independence number αBIP of a bipartite graph G is the maximum order of a balanced independent set of G. Let δ be the minimum degree of the graph. When G itself is balanced, we establish some relations between αBIP and the size or the connectivity of G. We also prove that the condition αBIP⩽δ(resp.αBIP⩽δ−1) implies that G is hamiltonian (resp. Hamilton-biconnected), thus improving a result of Fraisse
Total irredundance in graphs
AbstractA set S of vertices in a graph G is called a total irredundant set if, for each vertex v in G,v or one of its neighbors has no neighbor in S−{v}. We investigate the minimum and maximum cardinalities of maximal total irredundant sets
On k-factor-critical graphs
A graph is said to be k-factor-critical if the removal of any set of k vertices results in a graph with a perfect matching. We study some properties of k-factor-critical graphs and show that many results on q-extendable graphs can be improved using this concept
Partial Domination and Irredundance Numbers in Graphs
A dominating set of a graph is a vertex set such that every
vertex in is adjacent to a vertex in . The cardinality of
a smallest dominating set of is called the domination number of and is
denoted by . A vertex set is a -isolating set of if contains no -cliques. The minimum cardinality of a -isolating
set of is called the -isolation number of and is denoted by
. Clearly, . A vertex set is
irredundant if, for every non-isolated vertex of , there exists a
vertex in such that . An
irredundant set is maximal if the set is no longer
irredundant for any . The minimum cardinality of a
maximal irredundant set is called the irredundance number of and is denoted
by . Allan and Laskar \cite{AL1978} and Bollob\'{a}s and Cockayne
\cite{BoCo1979} independently proved that , which can be
written , for any graph . In this paper, for a graph
with maximum degree , we establish sharp upper bounds on
in terms of for
- …