Proof of a conjecture on irredundance perfect graphs

Let ir(G) and γ(G) be the irredundance number and the domination number of a graph G, respectively. A graph G is called irredundance perfect if ir(H)=γ(H), for every induced subgraph H of G. In this article we present a result which immediately implies three known conjectures on irredundance perfect graphs. © 2002 Wiley Periodicals, Inc. J Graph Theory 41: 292–306, 2002     

Upper Bounds to the Number of Vertices in a k-Critically n-Connected Graph

 Let k≤n be positive integers. A finite, simple, undirected graph is called k-critically n-connected, or, briefly, an (n,k)-graph, if it is noncomplete and n-connected and the removal of any set X of at most k vertices results in a graph which is not (n−|X|+1)-connected. We present some new results on the number of vertices of an (n,k)-graph, depending on new estimations of the transversal number of a uniform hypergraph with a large independent edge set. Received: April 14, 2000 Final version received: May 8, 2001     

A note on balance vertices in trees

The notion of balanced bipartitions of the vertices in a tree T was introduced and studied by Reid (Networks 34 (1999) 264). Reid proved that the set of balance vertices of a tree T consists of a single vertex or two adjacent vertices. In this note, we give a simple proof of that result.     

Several parameters of generalized Mycielskians

The generalized Mycielskians (also known as cones over graphs) are the natural generalization of the Mycielski graphs (which were first introduced by Mycielski in 1955). Given a graph G and any integer m?0, one can transform G into a new graph μ_m(G), the generalized Mycielskian of G. This paper investigates circular clique number, total domination number, open packing number, fractional open packing number, vertex cover number, determinant, spectrum, and biclique partition number of μ_m(G).     

A note on acyclic domination number in graphs of diameter two

A subset S of the vertex set of a graph G is called acyclic if the subgraph it induces in G contains no cycles. S is called an acyclic dominating set of G if it is both acyclic and dominating. The minimum cardinality of an acyclic dominating set, denoted by γ_a(G), is called the acyclic domination number of G. Hedetniemi et al. [Acyclic domination, Discrete Math. 222 (2000) 151-165] introduced the concept of acyclic domination and posed the following open problem: if δ(G) is the minimum degree of G, is γ_a(G)?δ(G) for any graph whose diameter is two? In this paper, we provide a negative answer to this question by showing that for any positive k, there is a graph G with diameter two such that γ_a(G)-δ(G)?k.     

Codiameters of 3‐connected 3‐domination critical graphs

A graph G is 3‐domination critical if its domination number γ is 3 and the addition of any edge decreases γ by 1. Let G be a 3‐connected 3‐domination critical graph of order n. In this paper, we show that there is a path of length at least n?2 between any two distinct vertices in G and the lower bound is sharp. © 2002 John Wiley & Sons, Inc. J Graph Theory 39: 76–85, 2002     

A general Hsu-Robbins-Erdős Type estimate of tail probabilities of sums of independent identically distributed random variables

Periodica Mathematica Hungarica - Let X 1,X 2,... be a sequence of independent and identically distributed random variables, and put % MATHTYPE!MTEF!2!1!+-%...     

乘积图的Fractional控制

Let G =(V,E) be a simple graph.For any real function g :V-→ R and a subset S V,we write g(S) =∑v∈Sg(v).A function f :V-→ [0,1] is said to be a fractional dominating function(F DF) of G if f(N [v]) ≥ 1 holds for every vertex v ∈ V(G).The fractional domination number γf(G) of G is defined as γf(G) = min{f(V)|f is an F DF of G }.The fractional total dominating function f is defined just as the fractional dominating function,the difference being that f(N(v)) ≥ 1 instead of f(N [v]) ≥ 1.The fractional total domination number γ0f(G) of G is analogous.In this note we give the exact values ofγf(Cm × Pn) and γ0f(Cm × Pn) for all integers m ≥ 3 and n ≥ 2.     

On Domination Number of 4-Regular Graphs

Let G be a simple graph. A subset S V is a dominating set of G, if for any vertex v V – S there exists a vertex u S such that uv E(G). The domination number, denoted by (G), is the minimum cardinality of a dominating set. In this paper we prove that if G is a 4-regular graph with order n, then (G) ⁴/₁₁ n