5 research outputs found
Cliques in the union of graphs
Let B and R be two simple graphs with vertex set V, and let G(B, R) be the simple graph with vertex set V, in which two vertices are adjacent if they are adjacent in at least one of Band R. For XβV, we denote by B|X the subgraph of B induced by X; let R|X and G(B, R)|X be defined similarly. A clique in a graph is a set of pairwise adjacent vertices. A subset UβV is obedient if U is the union of a clique of B and a clique of R. Our first result is that if B has no induced cycles of length four, and R has no induced cycles of length four or five, then every clique of G(B, R)is obedient. This strengthens a previous result of the second author, stating the same when B has no induced C_4 and R is chordal.
The clique number of a graph is the size of its maximum clique. We say that the pair (B, R)is additive if for every XβV, the sum of the clique numbers of B|X and R|X is at least the clique number of G(B, R)|X. Our second result is a sufficient condition for additivity of pairs of graphs
Red-blue clique partitions and (1-1)-transversals
Motivated by the problem of Gallai on -transversals of -intervals,
it was proved by the authors in 1969 that if the edges of a complete graph
are colored with red and blue (both colors can appear on an edge) so that there
is no monochromatic induced and then the vertices of can be
partitioned into a red and a blue clique. Aharoni, Berger, Chudnovsky and Ziani
recently strengthened this by showing that it is enough to assume that there is
no induced monochromatic and there is no induced in {\em one of the
colors}. Here this is strengthened further, it is enough to assume that there
is no monochromatic induced and there is no on which both color
classes induce a .
We also answer a question of Kaiser and Rabinovich, giving an example of six
-convex sets in the plane such that any three intersect but there is no
-transversal for them
A Characterisation of Strong Integer Additive Set-Indexers of Graphs
An integer additive set-indexer is defined as an injective function
such that the induced function defined by is also
injective, where is the sumset of and . If
, then is said to be a -uniform integer
additive set-indexers. An integer additive set-indexer is said to be a
strong integer additive set-indexer if . We already have some characteristics of the graphs which admit strong
integer additive set-indexers. In this paper, we study the characteristics of
certain graph classes, graph operations and graph products that admit strong
integer additive set-indexers.Comment: 10 page