Rainbow Connection Number, Bridges and Radius

Let G be a connected graph. The notion of rainbow connection number rc(G) of a graph G was introduced by Chartrand et al. (Math Bohem 133:85–98, 2008). Basavaraju et al. (arXiv:1011.0620v1 [math.CO], 2010) proved that for every bridgeless graph G with radius r, ${rc(G)\leq r(r+2)}$ and the bound is tight. In this paper, we show that for a connected graph G with radius r and center vertex u, if we let D ^r  = {u}, then G has r?1 connected dominating sets ${ D^{r-1}, D^{r-2},\ldots, D^{1}}$ such that ${D^{r} \subset D^{r-1} \subset D^{r-2} \cdots\subset D^{1} \subset D^{0}=V(G)}$ and ${rc(G)\leq \sum_{i=1}^{r} \max \{2i+1,b_i\}}$ , where b _i is the number of bridges in E[D ⁱ , N(D ⁱ )] for ${1\leq i \leq r}$ . From the result, we can get that if ${b_i\leq 2i+1}$ for all ${1\leq i\leq r}$ , then ${rc(G)\leq \sum_{i=1}^{r}(2i+1)= r(r+2)}$ ; if b _i  > 2i + 1 for all ${1\leq i\leq r}$ , then ${rc(G)= \sum_{i=1}^{r}b_i}$ , the number of bridges of G. This generalizes the result of Basavaraju et al. In addition, an example is given to show that there exist infinitely graphs with bridges whose rc(G) is only dependent on the radius of G, and another example is given to show that there exist infinitely graphs with bridges whose rc(G) is only dependent on the number of bridges in G.     

Fractional f-Edge Cover Chromatic Index of Graphs

Let G be a graph, and let f be an integer function on V with ${1\leq f(v)\leq d(v)}$ to each vertex ${\upsilon \in V}$ . An f-edge cover coloring is a coloring of edges of E(G) such that each color appears at each vertex ${\upsilon \in V(G)}$ at least f(υ) times. The maximum number of colors needed to f-edge cover color G is called the f-edge cover chromatic index of G and denoted by ${\chi^{'}_{fc}(G)}$ . It is well known that any simple graph G has the f-edge cover chromatic index equal to δ _f (G) or δ _f (G) ? 1, where ${\delta_{f}(G)=\,min\{\lfloor \frac{d(v)}{f(v)} \rfloor: v\in V(G)\}}$ . The fractional f-edge cover chromatic index of a graph G, denoted by ${\chi^{'}_{fcf}(G)}$ , is the fractional f-matching number of the edge f-edge cover hypergraph ${\mathcal{H}}$ of G whose vertices are the edges of G and whose hyperedges are the f-edge covers of G. In this paper, we give an exact formula of ${\chi^{'}_{fcf}(G)}$ for any graph G, that is, ${\chi^{'}_{fcf}(G)=\,min \{\min\limits_{v\in V(G)}d_{f}(v), \lambda_{f}(G)\}}$ , where ${\lambda_{f}(G)=\min\limits_{S} \frac{|C[S]|}{\lceil (\sum\limits_{v\in S}{f(v)})/2 \rceil}}$ and the minimum is taken over all nonempty subsets S of V(G) and C[S] is the set of edges that have at least one end in S.     

The Chvátal–Erdös Condition for Group Connectivity in Graphs

Let G be a graph and A an abelian group with the identity element 0 and ${|A| \geq 4}$ . Let D be an orientation of G. The boundary of a function ${f: E(G) \rightarrow A}$ is the function ${\partial f: V(G) \rightarrow A}$ given by ${\partial f(v) = \sum_{e \in E^+(v)}f(e) - \sum_{e \in E^-(v)}f(e)}$ , where ${v \in V(G), E^+(v)}$ is the set of edges with tail at v and ${E^-(v)}$ is the set of edges with head at v. A graph G is A-connected if for every b: V(G) → A with ${\sum_{v \in V(G)} b(v) = 0}$ , there is a function ${f: E(G) \mapsto A-\{0\}}$ such that ${\partial f = b}$ . A graph G is A-reduced to G′ if G′ can be obtained from G by contracting A-connected subgraphs until no such subgraph left. Denote by ${\kappa^{\prime}(G)}$ and α(G) the edge connectivity and the independent number of G, respectively. In this paper, we prove that for a 2-edge-connected simple graph G, if ${\kappa^{\prime}(G) \geq \alpha(G)-1}$ , then G is A-connected or G can be A-reduced to one of the five specified graphs or G is one of the 13 specified graphs.     

An Upper Bound for the Total Restrained Domination Number of Graphs

Let G be a graph with vertex set V. A set ${D \subseteq V}$ is a total restrained dominating set of G if every vertex in V has a neighbor in D and every vertex in ${V \setminus D}$ has a neighbor in ${V \setminus D}$ . The minimum cardinality of a total restrained dominating set of G is called the total restrained domination number of G, and is denoted by γ _tr (G). In this paper, we prove that if G is a connected graph of order n ≥ 4 and minimum degree at least two, then ${\gamma_{tr}(G) \leq n-\sqrt[3]{n \over 4}}$ .     

On Group Choosability of Graphs,II

Given a group A and a directed graph G, let F(G, A) denote the set of all maps ${f : E(G) \rightarrow A}$ . Fix an orientation of G and a list assignment ${L : V(G) \mapsto 2^A}$ . For an ${f \in F(G, A)}$ , G is (A, L, f)-colorable if there exists a map ${c:V(G) \mapsto \cup_{v \in V(G)}L(v)}$ such that ${c(v) \in L(v)}$ , ${\forall v \in V(G)}$ and ${c(x)-c(y)\neq f(xy)}$ for every edge e = xy directed from x to y. If for any ${f\in F(G,A)}$ , G has an (A, L, f)-coloring, then G is (A, L)-colorable. If G is (A, L)-colorable for any group A of order at least k and for any k-list assignment ${L:V(G) \rightarrow 2^A}$ , then G is k-group choosable. The group choice number, denoted by ${\chi_{gl}(G)}$ , is the minimum k such that G is k-group choosable. In this paper, we prove that every planar graph is 5-group choosable, and every planar graph with girth at least 5 is 3-group choosable. We also consider extensions of these results to graphs that do not have a K ₅ or a K _3,3 as a minor, and discuss group choosability versions of Hadwiger’s and Woodall’s conjectures.     

Degree Sum Conditions for Cyclability in Bipartite Graphs

We denote by G[X, Y] a bipartite graph G with partite sets X and Y. Let d _G (v) be the degree of a vertex v in a graph G. For G[X, Y] and ${S \subseteq V(G),}$ we define ${\sigma_{1,1}(S):=\min\{d_G(x)+d_G(y) : (x,y) \in (X \cap S,Y) \cup (X, Y \cap S), xy \not\in E(G)\}}$ . Amar et al. (Opusc. Math. 29:345–364, 2009) obtained σ _1,1(S) condition for cyclability of balanced bipartite graphs. In this paper, we generalize the result as it includes the case of unbalanced bipartite graphs: if G[X, Y] is a 2-connected bipartite graph with |X| ≥ |Y| and ${S \subseteq V(G)}$ such that σ _1,1(S) ≥ |X| + 1, then either there exists a cycle containing S or ${|S \cap X| > |Y|}$ and there exists a cycle containing Y. This degree sum condition is sharp.     

Exponential sums over primes and the prime twin problem

The purpose of this paper is to obtain an effective estimate of the exponential sum $\sum_{n\le x}\Lambda(n)e\left(\left(\frac{a}{q}+\beta\right)n\right)$ (where e(??)=e ^{2?? i ??} , ??,?????, (a,q)=1 and ?? is the von Mangoldt function) in the range ${(\log x)}^{1/2+\varepsilon}\le q\le \frac{x}{{(\log\log\log x)}^{1+\varepsilon}}$ and $|\beta|<\frac{1}{q{(\log\log\log x)}^{1+\varepsilon}}$ . It improves Daboussi??s estimate [2, Theorem 1] in the range q??(log?x) ^D and x(log?x)^?D ??q, D>0 and is valid in a wider range for ??.     

Signed total (k, k)-domatic number of digraphs

Let D be a finite and simple digraph with vertex set V(D), and let f: V(D) → {?1, 1} be a two-valued function. If k ≥?1 is an integer and ${\sum_{x \in N^-(v)}f(x) \ge k}$ for each ${v \in V(G)}$ , where N ^?(v) consists of all vertices of D from which arcs go into v, then f is a signed total k-dominating function on D. A set {f ₁, f ₂, . . . , f _d } of signed total k-dominating functions on D with the property that ${\sum_{i=1}^df_i(x)\le k}$ for each ${x \in V(D)}$ , is called a signed total (k, k)-dominating family (of functions) on D. The maximum number of functions in a signed total (k, k)-dominating family on D is the signed total (k, k)-domatic number on D, denoted by ${d_{st}^{k}(D)}$ . In this paper we initiate the study of the signed total (k, k)-domatic number of digraphs, and we present different bounds on ${d_{st}^{k}(D)}$ . Some of our results are extensions of known properties of the signed total domatic number ${d_{st}(D)=d_{st}^{1}(D)}$ of digraphs D as well as the signed total domatic number d _st (G) of graphs G, given by Henning (Ars Combin. 79:277–288, 2006).     

The Domination Polynomial of a Graph at −1

Let G be a simple graph. The domination polynomial of a graph G of order n is the polynomial ${D(G,x)=\sum_{i=0}^{n} d(G,i) x^{i}}$ , where d(G, i) is the number of dominating sets of G of size i. In this article we investigate the domination polynomial at ?1. We give a construction showing that for each odd number n there is a connected graph G with D(G, ?1) = n.     

On Zero-Sum {\mathbb{Z}_k} -Magic Labelings of 3-Regular Graphs

Let G =  (V, E) be a finite loopless graph and let (A, +) be an abelian group with identity 0. Then an A-magic labeling of G is a function ${\phi}$ from E into A ? {0} such that for some ${a \in A, \sum_{e \in E(v)} \phi(e) = a}$ for every ${v \in V}$ , where E(v) is the set of edges incident to v. If ${\phi}$ exists such that a =  0, then G is zero-sum A-magic. Let zim(G) denote the subset of ${\mathbb{N}}$ (the positive integers) such that ${1 \in zim(G)}$ if and only if G is zero-sum ${\mathbb{Z}}$ -magic and ${k \geq 2 \in zim(G)}$ if and only if G is zero-sum ${\mathbb{Z}_k}$ -magic. We establish that if G is 3-regular, then ${zim(G) = \mathbb{N} - \{2\}}$ or ${\mathbb{N} - \{2,4\}.}$      

Binding number and minimum degree for the existence of (g,f,n)-critical graphs

Let G be a graph of order p. The binding number of G is defined as $\mbox{bind}(G):=\min\{\frac{|N_{G}(X)|}{|X|}\mid\emptyset\neq X\subseteq V(G)\,\,\mbox{and}\,\,N_{G}(X)\neq V(G)\}$ . Let g(x) and f(x) be two nonnegative integer-valued functions defined on V(G) with g(x)≤f(x) for any x∈V(G). A graph G is said to be (g,f,n)-critical if G?N has a (g,f)-factor for each N?V(G) with |N|=n. If g(x)≡a and f(x)≡b for all x∈V(G), then a (g,f,n)-critical graph is an (a,b,n)-critical graph. In this paper, several sufficient conditions on binding number and minimum degree for graphs to be (a,b,n)-critical or (g,f,n)-critical are given. Moreover, we show that the results in this paper are best possible in some sense.     

Toughness and Matching Extension in {\mathcal{P}_3}-Dominated Graphs

Let G be a connected graph. For ${x,y\in V(G)}$ with d(x, y) = 2, we define ${J(x,y)= \{u \in N(x)\cap N(y)\mid N[u] \subseteq N[x] \,{\cup}\,N[y] \}}$ and ${J'(x,y)= \{u \in N(x) \cap N(y)\,{\mid}\,{\rm if}\ v \in N(u){\setminus}(N[x] \,{\cup}\, N[y])\ {\rm then}\ N[x] \,{\cup}\, N[y]\,{\cup}\,N[u]{\setminus}\{x,y\}\subseteq N[v]\}}$ . A graph G is quasi-claw-free if ${J(x,y) \not= \emptyset}$ for each pair (x, y) of vertices at distance 2 in G. Broersma and Vumar (in Math Meth Oper Res. doi:10.1007/s00186-008-0260-7) introduced ${\mathcal{P}_{3}}$ -dominated graphs defined as ${J(x,y)\,{\cup}\, J'(x,y)\not= \emptyset}$ for each ${x,y \in V(G)}$ with d(x, y) = 2. This class properly contains that of quasi-claw-free graphs, and hence that of claw-free graphs. In this note, we prove that a 2-connected ${\mathcal{P}_3}$ -dominated graph is 1-tough, with two exceptions: K _2,3 and K _1,1,3, and prove that every even connected ${\mathcal{P}_3}$ -dominated graph ${G\ncong K_{1,3}}$ has a perfect matching. Moreover, we show that every even (2p + 1)-connected ${\mathcal{P}_3}$ -dominated graph is p-extendable. This result follows from a stronger result concerning factor-criticality of ${\mathcal{P}_3}$ -dominated graphs.     

On the existence and smoothness of a generalized solution of a nonlinear differential equation with degeneration

Let Ω be an arbitrary open set in R _n , and let σ(x) and g _i (x), i = 1, 2, ..., n, be positive functions in Ω. We prove a embedding theorem of different metrics for the spaces W _p ^r (Ω, σ, $ \vec g $ ), where r ∈ N, p ≥ 1, and $ \vec g $ (x) = (g ₁(x), g ₂(x), ..., g _n (x)), with the norm $$ \left\| {u;W_p^r (\Omega ;\sigma ,\vec g)} \right\| = \left\{ {\left\| {u;L_{p,r}^r (\Omega ;\sigma ,\vec g)} \right\|^p + \left\| {u;L_{p,r}^0 (\Omega ;\sigma ,\vec g)} \right\|^p } \right\}^{{1 \mathord{\left/ {\vphantom {1 p}} \right. \kern-\nulldelimiterspace} p}} , $$ where $$ \left\| {u;L_{p,r}^m (\Omega ;\sigma ,\vec g)} \right\| = \left\{ {\sum\limits_{\left| k \right| = m} {\int\limits_\Omega {(\sigma (x)g_1^{k_1 - r} (x)g_2^{k_2 - r} (x) \cdots g_n^{k_n - r} (x)\left| {u^{(k)} (x)} \right|)^p dx} } } \right\}^{{1 \mathord{\left/ {\vphantom {1 p}} \right. \kern-\nulldelimiterspace} p}} , $$ We use this theorem to prove the existence and uniqueness of a minimizing element U(x) ∈ W _p ^r (Ω, σ, $ \vec g $ ) for the functional $$ \Phi (u) = \sum\limits_{\left| k \right| \leqslant r} {\frac{1} {{p_k }}\int\limits_\Omega {a_k (x)} \left| {u^{(k)} (x)} \right|^{p_k } } dx - \left\langle {F,u} \right\rangle , $$ where F is a given functional. We show that the function U(x) is a generalized solution of the corresponding nonlinear differential equation. For the case in which Ω is bounded, we study the differential properties of the generalized solution depending on the smoothness of the coefficients and the right-hand side of the equation.     

Super Edge-connectivity and Zeroth-order General Randić Index for −1 ≤ <Emphasis Type="Italic">α</Emphasis> &lt; 0

Let G be a connected graph with order n, minimum degree δ = δ(G) and edge-connectivity λ = λ(G). A graph G is maximally edge-connected if λ = δ, and super edge-connected if every minimum edgecut consists of edges incident with a vertex of minimum degree. Define the zeroth-order general Randi? index \(R_\alpha ^0\left( G \right) = \sum\limits_{x \in V\left( G \right)} {d_G^\alpha \left( x \right)} \), where d_G(x) denotes the degree of the vertex x. In this paper, we present two sufficient conditions for graphs and triangle-free graphs to be super edge-connected in terms of the zeroth-order general Randi? index for ?1 ≤ α < 0, respectively.     

On groups with large character degree sums

Let G be a finite group, and let T(G) be the sum of all complex irreducible character degrees of G. Define ${f(G) = \frac{T(G)}{|G|}}$ . In this paper, we show that if G is a finite group and ${f(G) > \frac{4}{15}}$ , then G is solvable.     

Upper bounds on the signed (k, k)-domatic number

Let G be a graph with vertex set V(G), and let f : V(G) → {?1, 1} be a two-valued function. If k ≥ 1 is an integer and ${\sum_{x\in N[v]} f(x) \ge k}$ for each ${v \in V(G)}$ , where N[v] is the closed neighborhood of v, then f is a signed k-dominating function on G. A set {f ₁,f ₂, . . . ,f _d } of distinct signed k-dominating functions on G with the property that ${\sum_{i=1}^d f_i(x) \le k}$ for each ${x \in V(G)}$ , is called a signed (k, k)-dominating family (of functions) on G. The maximum number of functions in a signed (k, k)-dominating family on G is the signed (k, k)-domatic number of G. In this article we mainly present upper bounds on the signed (k, k)-domatic number, in particular for regular graphs.     

The “Full Müntz Theorem” inL p[0, 1] for 0<p<∞

Denote by span {f ₁,f ₂, …} the collection of all finite linear combinations of the functionsf ₁,f ₂, … over ?. The principal result of the paper is the following. Theorem (Full Müntz Theorem in L_p(A) for p ∈ (0, ∞) and for compact sets A ? [0, 1] with positive lower density at 0). Let A ? [0, 1] be a compact set with positive lower density at 0. Let p ∈ (0, ∞). Suppose (λ _j ) _j=1 ^∞ is a sequence of distinct real numbers greater than ?(1/p). Then span {x ^λ1,x ^λ2,…} is dense in L_p(A) if and only if $\sum\limits_{j = 1}^\infty {\frac{{\lambda _j + \left( {1/p} \right)}}{{\left( {\lambda _j + \left( {1/p} \right)} \right)^2 + 1}} = \infty } $ . Moreover, if $\sum\limits_{j = 1}^\infty {\frac{{\lambda _j + \left( {1/p} \right)}}{{\left( {\lambda _j + \left( {1/p} \right)} \right)^2 + 1}} = \infty } $ , then every function from the L_p(A) closure of {x ^λ1,x ^λ2,…} can be represented as an analytic function on {z ∈ ? \ (?∞,0] : |z| < r_A} restricted to A ∩ (0, r_A) where $r_A : = \sup \left\{ {y \in \mathbb{R}:\backslash ( - \infty ,0]:\left| z \right|< r_A } \right\}$ (m(·) denotes the one-dimensional Lebesgue measure). This improves and extends earlier results of Müntz, Szász, Clarkson, Erdös, P. Borwein, Erdélyi, and Operstein. Related issues about the denseness of {x ^λ1,x ^λ2,…} are also considered.     

On the Roots of Domination Polynomials

The domination polynomial of a graph G of order n is the polynomial ${D(G, x) = \sum_{i=\gamma(G)}^{n} d(G, i)x^i}$ where d(G, i) is the number of dominating sets of G of size i, and γ(G) is the domination number of G. We investigate here domination roots, the roots of domination polynomials. We provide an explicit family of graphs for which the domination roots are in the right half-plane. We also determine the limiting curves for domination roots of complete bipartite graphs. Finally, we prove that the closure of the roots is the entire complex plane.     

Arithmetic properties of certain polyadic series

Arithmetic properties of series of the form $\sum\nolimits_{n = 0}^\infty {p(n)} \cdot n!$ , p(n) ?? ?[x] are studied.     

A Spanning Tree with High Degree Vertices

Let G be a connected graph, let ${X \subset V(G)}$ and let f be a mapping from X to {2, 3, . . .}. Kaneko and Yoshimoto (Inf Process Lett 73:163–165, 2000) conjectured that if |N _G (S) ? X| ≥ f (S) ? 2|S| + ω _G (S) + 1 for any subset ${S \subset X}$ , then there exists a spanning tree T such that d _T (x) ≥ f (x) for all ${x \in X}$ . In this paper, we show a result with a stronger assumption than this conjecture; if |N _G (S) ? X| ≥ f (S) ? 2|S| + α(S) + 1 for any subset ${S \subset X}$ , then there exists a spanning tree T such that d _T (x) ≥ f (x) for all ${x \in X}$ .