Let @math be a connected graph of order @math , whose minimum vertex degree is at least @math . A subset @math of vertices in @math is a @math -tuple total dominating set if every vertex of @math is adjacent to at least @math vertices in @math . The minimum cardinality of a @math -tuple total dominating set of @math is the @math -tuple total domination number of @math , denoted by @math . Henning and Yeo in hen proved that if @math is a cubic graph different from the Heawood graph, @math , and this bound is sharp. Similarly, a @math -tuple dominating set is a subset @math of vertices of @math , @math such that @math for every vertex @math , where @math . The @math -tuple domination number of @math , denoted by @math , is the minimum cardinality of a @math -tuple dominating set of @math . In this paper, we give a simple approach to compute an upper bound for @math -tuple total domination number of @math -regular graphs. Also, we give an upper bound for the @math -tuple dominating number of @math -regular graphs. In addition, our method gives algorithms to compute dominating sets with the given bounds, while the previous methods are existential.
Let @math be the Heawood graph (or, equivalently, the incidence bipartite graph of the Fano plane) on @math vertices shown in Figure . In @cite_7 , Henning and Yeo proved some theorems about strong transversal in hypergraphs and then as an application of their hypergraph results they proved the following theorem.
@cite_7
2070948578 326952175 2155295958 1485502831
Let @math be a 3-uniform hypergraph of order @math and size @math , and let @math be a subset of vertices of @math . The set @math is a strong transversal in @math if @math contains at least two vertices from every edge of @math . The strong transversal number @math of @math is the minimum size of a strong transversal in @math . We show that @math , and we characterize the hypergraphs that achieve equality in this bound. In particular, we show that the Fano plane is the only connected 3-uniform hypergraph @math of order @math and size @math that achieves equality in this bound. A set @math of vertices in a graph @math is a double total dominating set of @math if every vertex of @math is adjacent to at least two vertices in @math . The minimum cardinality of a double total dominating set of @math is the double total domination number @math of @math . Let @math be a connected graph of order @math with minimum degree at least three. As an application of our hypergraph results, we show that @math with equality if and only if @math is the Heawood graph (equivalently, the incidence bipartite graph of the Fano plane). Further if @math is not the Heawood graph, we show that @math , while if @math is a cubic graph different from the Heawood graph, we show that @math , and this bound is sharp. We prove an incidence theorem for points and planes in the projective space @math over any field @math , whose characteristic @math An incidence is viewed as an intersection along a line of a pair of two-planes from two canonical rulings of the Klein quadric. The Klein quadric can be traversed by a generic hyperplane, yielding a line-line incidence problem in a three-quadric, the Klein image of a regular line complex. This hyperplane can be chosen so that at most two lines meet. Hence, one can apply an algebraic theorem of Guth and Katz, with a constraint involving @math if @math . This yields a bound on the number of incidences between @math points and @math planes in @math , with @math as @math where @math is the maximum number of collinear planes, provided that @math if @math . Examples show that this bound cannot be improved without additional assumptions. This gives one a vehicle to establish geometric incidence estimates when @math . For a non-collinear point set @math and a non-degenerate symmetric or skew-symmetric bilinear form @math , the number of distinct values of @math on pairs of points of @math is @math . This is also the best known bound over @math , where it follows from the Szemer 'edi-Trotter theorem. Also, a set @math , not supported in a single semi-isotropic plane contains a point, from which @math distinct distances to other points of @math are attained. Suppose we are given a bipartite graph with vertex set X, Y, |X| = n , |Y| = N , each point in X (Y) has degree D(d) fixed, respectively, moreover, each pair of points x, x' ∈ X has at most D (log n) 3 (common) neighbours. Let t (X, Y) denote the minimum number of vertices of Y needed to cover all vertices of X. We prove (Theorem 1.1) that t (X, Y) d n tends to 1 as n tends to infinity. This result has many applications: Theorem [5]. Suppose k > r > 1 are fixed, n → ∞. Then there exists a collection of (1 + o (1)) × ( n r ) ( k r ) k -subsets of an n -set so that each r -subset is contained in at least one member of the collection. Analogues and strengthenings of this result are deduced. E.g. for vector spaces, orthogonal or simplectic geometries, random collections of k -sets with constant probabilities, etc. Theorem 3.3. Suppose G is a graph on v vertices and e edges and ℛ is a random graph on n vertices and edge probability e ( v 2 ). Then there exists a collection of (1 + o (1))( n 2 ) ( v 2 ) induced subgraphs of ℛ on v vertices, isomorphic to G and such that each edge (non-edge) of ℛ is covered by an edge (non-edge) of a graph in the collection. A theorem of A. Schrijver asserts that a d-regular bipartite graph on 2n vertices has at least @math perfect matchings. L. Gurvits gave an extension of Schrijver’s theorem for matchings of density p. In this paper we give a stronger version of Gurvits’s theorem in the case of vertex-transitive bipartite graphs. This stronger version in particular implies that for every positive integer k, there exists a positive constant c(k) such that if a d-regular vertex-transitive bipartite graph on 2n vertices contains a cycle of length at most k, then it has at least @math perfect matchings.