Analysis of the impact of the number of edges in connected graphs on the computational complexity of the independent set problem

Under study is the complexity status of the independent set problem in a class of connected graphs that are defined by functional constraints on the number of edges depending on the number of vertices. For every natural number C, this problem is shown to be polynomially solvable in the class of graphs

Recurrent approach to Blaschke’s problem

We have obtained a recurrence formula $I_{n+3} = \frac{4(n+3)}{\pi(n+4)}VI_{n+1}We have obtained a recurrence formula I_n+3 = \frac4(n+3)p(n+4)VI_n+1I_{n+3} = \frac{4(n+3)}{\pi(n+4)}VI_{n+1} for integro-geometric moments in the case of a circle with the area V, where I_n = ò\nolimits_{K ?G}sⁿd GI_n = \int \nolimits_{K \cap G}\sigma^{n}{\rm d} G, while in the case of a convex domain K with the perimeter S and area V the recurrence formula

In+3 = \frac8(n+3)V2(n+1)(n+4)p[\fracd In+1d V - \fracIn+1S \fracd Sd V ] I_{n+3} = \frac{8(n+3)V^2}{(n+1)(n+4)\pi}\Big[\frac{{\rm d} I_{n+1}}{{\rm d} V} - \frac{I_{n+1}}{S} \frac{{\rm d} S}{{\rm d} V} \Big]      3. Equality of two variable weighted means: reduction to differential equations      L. Losonczi 《Aequationes Mathematicae》1999,58(3):223-241 Summary. Let F, Y \Phi, \Psi be strictly monotonic continuous functions, F,G be positive functions on an interval I and let n ? \Bbb N \{1} n \in {\Bbb N} \setminus \{1\} . The functional equation¶¶F-1 ([(?i=1nF(xi)F(xi))/(?i=1n F(xi)]) Y-1 ([(?i=1nY(xi)G(xi))/(?i=1n G(xi))])  (x1,?,xn ? I) \Phi^{-1}\,\left({\sum\limits_{i=1}^{n}\Phi(x_{i})F(x_{i})\over\sum\limits_{i=1}^{n} F(x_{i}}\right) \Psi^{-1}\,\left({\sum\limits_{i=1}^{n}\Psi(x_{i})G(x_{i})\over\sum\limits_{i=1}^{n} G(x_{i})}\right)\,\,(x_{1},\ldots,x_{n} \in I) ¶was solved by Bajraktarevi' [3] for a fixed n 3 3 n\ge 3 . Assuming that the functions involved are twice differentiable he proved that the above functional equation holds if and only if¶¶Y(x) = [(aF(x) + b)/(cF(x) + d)],       G(x) = kF(x)(cF(x) + d) \Psi(x) = {a\Phi(x)\,+\,b\over c\Phi(x)\,+\,d},\qquad G(x) = kF(x)(c\Phi(x) + d) ¶where a,b,c,d,k are arbitrary constants with k(c2+d2)(ad-bc) 1 0 k(c^2+d^2)(ad-bc)\ne 0 . Supposing the functional equation for all n = 2,3,... n = 2,3,\dots Aczél and Daróczy [2] obtained the same result without differentiability conditions.¶The case of fixed n = 2 is, as in many similar problems, much more difficult and allows considerably more solutions. Here we assume only that the same functional equation is satisfied for n = 2 and solve it under the supposition that the functions involved are six times differentiable. Our main tool is the deduction of a sixth order differential equation for the function j = F°Y-1 \varphi = \Phi\circ\Psi^{-1} . We get 32 new families of solutions.      4. On properties of entire solutions of linear differential equations with polynomial coefficients      Ya. S. Mahola  M. M. Sheremeta 《Journal of Mathematical Sciences》2012,181(3):366-382 We investigate properties of entire solutions of differential equations of the form znw(n) + ?j = n - m + 1n - 1 an - j + 1(j)zjw(j) + ?j = 0n - m ( an - j - m + 1(j)zm + an - j + 1(j) )zjw(j) = 0, {z^n}{w^{(n)}} + \sum\limits_{j = n - m + 1}^{n - 1} {a_{n - j + 1}^{(j)}{z^j}{w^{(j)}}} + \sum\limits_{j = 0}^{n - m} {\left( {a_{n - j - m + 1}^{(j)}{z^m} + a_{n - j + 1}^{(j)}} \right){z^j}{w^{(j)}}} = 0,      5. Connected Domination Number of a Graph and its Complement      H. Karami  S. M. Sheikholeslami  Abdollah Khodkar  Douglas B. West 《Graphs and Combinatorics》2012,28(1):123-131 A set S of vertices in a graph G is a connected dominating set if every vertex not in S is adjacent to some vertex in S and the subgraph induced by S is connected. The connected domination number γ c (G) is the minimum size of such a set. Let d*(G)=min{d(G),d([`(G)])}{\delta^*(G)={\rm min}\{\delta(G),\delta({\overline{G}})\}} , where [`(G)]{{\overline{G}}} is the complement of G and δ(G) is the minimum vertex degree. We prove that when G and [`(G)]{{\overline{G}}} are both connected, gc(G)+gc([`(G)]) ￡ d*(G)+4-(gc(G)-3)(gc([`(G)])-3){{\gamma_c}(G)+{\gamma_c}({\overline{G}})\le \delta^*(G)+4-({\gamma_c}(G)-3)({\gamma_c}({\overline{G}})-3)} . As a corollary, gc(G)+gc([`(G)]) ￡ \frac3n4{{\gamma_c}(G)+{\gamma_c}({\overline{G}})\le \frac{3n}{4}} when δ*(G) ≥ 3 and n ≥ 14, where G has n vertices. We also prove that gc(G)+gc([`(G)]) ￡ d*(G)+2{{\gamma_c}(G)+{\gamma_c}({\overline{G}})\le \delta^*(G)+2} when gc(G),gc([`(G)]) 3 4{{\gamma_c}(G),{\gamma_c}({\overline{G}})\ge 4} . This bound is sharp when δ*(G) = 6, and equality can only hold when δ*(G) = 6. Finally, we prove that gc(G)gc([`(G)]) ￡ 2n-4{{\gamma_c}(G){\gamma_c}({\overline{G}})\le 2n-4} when n ≥ 7, with equality only for paths and cycles.      6. Preservation of Absolutely Continuous Spectrum of?Periodic Jacobi Operators Under Perturbations of?Square-Summable Variation      U. Kaluzhny  M. Shamis 《Constructive Approximation》2012,35(1):89-105 We study self-adjoint bounded Jacobi operators of the form: (Jy)(n) = any(n + 1) + bny(n) + an-1y(n- 1)(\mathbf{J}\psi)(n) = a_{n}\psi(n + 1) + b_{n}\psi(n) + a_{n-1}\psi(n- 1)      7. How quadratic are the natural numbers?      Friedrich Roesler 《Archiv der Mathematik》1999,73(3):193-198 Abstract. For natural numbers n we inspect all factorizations n = ab of n with a ￡ ba \le b in \Bbb N\Bbb N and denote by n=an bnn=a_n b_n the most quadratic one, i.e. such that bn - anb_n - a_n is minimal. Then the quotient k(n) : = an/bn\kappa (n) := a_n/b_n is a measure for the quadraticity of n. The best general estimate for k(n)\kappa (n) is of course very poor: 1/n ￡ k(n) ￡ 11/n \le \kappa (n)\le 1. But a Theorem of Hall and Tenenbaum [1, p. 29], implies(logn)-d-e ￡ k(n) ￡ (logn)-d(\log n)^{-\delta -\varepsilon } \le \kappa (n) \le (\log n)^{-\delta } on average, with d = 1 - (1+log2  2)/log2=0,08607 ?\delta = 1 - (1+\log _2 \,2)/\log 2=0,08607 \ldots and for every e > 0\varepsilon >0. Hence the natural numbers are fairly quadratic.¶k(n)\kappa (n) characterizes a specific optimal factorization of n. A quadraticity measure, which is more global with respect to the prime factorization of n, is k*(n): = ?1 ￡ a ￡ b, ab=n a/b\kappa ^*(n):= \textstyle\sum\limits \limits _{1\le a \le b, ab=n} a/b. We show k*(n) ~ \frac 12\kappa ^*(n) \sim \frac {1}{2} on average, and k*(n)=W(2\frac 12(1-e) log n/log 2n)\kappa ^*(n)=\Omega (2^{\frac {1}{2}(1-\varepsilon ) {\log}\, n/{\log} _2n})for every e > 0\varepsilon>0.      8. Pan-H-Linked Graphs      Michael Ferrara  Colton Magnant  Jeffrey Powell 《Graphs and Combinatorics》2010,26(2):225-242 Let H be a multigraph, possibly containing loops. An H-subdivision is any simple graph obtained by replacing the edges of H with paths of arbitrary length. Let H be an arbitrary multigraph of order k, size m, n 0(H) isolated vertices and n 1(H) vertices of degree one. In Gould and Whalen (Graphs Comb. 23:165–182, 2007) it was shown that if G is a simple graph of order n containing an H-subdivision H{\mathcal{H}} and d(G) 3 \fracn+m-k+n1(H)+2n0(H)2{\delta(G) \ge \frac{n+m-k+n_1(H)+2n_0(H)}{2}}, then G contains a spanning H-subdivision with the same ground set as H{\mathcal{H}} . As a corollary to this result, the authors were able to obtain Dirac’s famed theorem on hamiltonian graphs; namely that if G is a graph of order n ≥ 3 with d(G) 3 \fracn2{\delta(G)\ge\frac{n}{2}} , then G is hamiltonian. Bondy (J. Comb. Theory Ser. B 11:80–84, 1971) extended Dirac’s theorem by showing that if G satisfied the condition d(G) 3 \fracn2{\delta(G) \ge \frac{n}{2}} then G was either pancyclic or a complete bipartite graph. In this paper, we extend the result from Gould and Whalen (Graphs Comb. 23:165–182, 2007) in a similar manner. An H-subdivision H{\mathcal{H}} in G is 1-extendible if there exists an H-subdivision H*{\mathcal{H}^{*}} with the same ground set as H{\mathcal{H}} and |H*| = |H| + 1{|\mathcal{H}^{*}| = |\mathcal{H}| + 1} . If every H-subdivision in G is 1-extendible, then G is pan-H-linked. We demonstrate that if H is sufficiently dense and G is a graph of large enough order n such that d(G) 3 \fracn+m-k+n1(H)+2n0(H)2{\delta(G) \ge \frac{n+m-k+n_1(H)+2n_0(H)}{2}} , then G is pan-H-linked. This result is sharp.      9. Hook Lengths and 3-Cores      Guo-Niu Han  Ken Ono 《Annals of Combinatorics》2011,15(2):305-312 Recently, the first author generalized a formula of Nekrasov and Okounkov which gives a combinatorial formula, in terms of hook lengths of partitions, for the coefficients of certain power series. In the course of this investigation, he conjectured that a(n) = 0 if and only if b(n) = 0, where integers a(n) and b(n) are defined by ?￥n=0 a(n)xn : = ?￥n=1  (1-xn)8,\sum^{\infty}_{n=0}\, a(n)x^{n} := \prod^{\infty}_{n=1} \, (1-x^{n})^8,      10. Type II Hermite�CPad�� Approximations of Generalized Hypergeometric Series      Tapani Matala-aho 《Constructive Approximation》2011,33(3):289-312 We shall present short proofs for type II (simultaneous) Hermite–Padé approximations of the generalized hypergeometric and q-hypergeometric series F(t)=?n=0￥\frac?k=0n-1P(k)?k=0n-1Q(k)tn,       Fq(t)=?n=0￥\frac?k=0n-1P(qk)?k=0n-1Q(qk)tn,F(t)=\sum_{n=0}^{\infty}\frac{\prod_{k=0}^{n-1}P(k)}{\prod _{k=0}^{n-1}Q(k)}t^n,\qquad F_q(t)=\sum_{n=0}^{\infty}\frac{\prod_{k=0}^{n-1}P(q^k)}{\prod _{k=0}^{n-1}Q(q^k)}t^n,      设为首页 | 免责声明 | 关于勤云 | 加入收藏 Copyright©北京勤云科技发展有限公司  京ICP备09084417号

Equality of two variable weighted means: reduction to differential equations

Summary. Let F, Y \Phi, \Psi be strictly monotonic continuous functions, F,G be positive functions on an interval I and let n ? \Bbb N \{1} n \in {\Bbb N} \setminus \{1\} . The functional equation¶¶F^-1 ([(?_i=1ⁿF(x_i)F(x_i))/(?_i=1ⁿ F(x_i)]) Y^-1 ([(?_i=1ⁿY(x_i)G(x_i))/(?_i=1ⁿ G(x_i))])  (x₁,?,x_n ? I) \Phi^{-1}\,\left({\sum\limits_{i=1}^{n}\Phi(x_{i})F(x_{i})\over\sum\limits_{i=1}^{n} F(x_{i}}\right) \Psi^{-1}\,\left({\sum\limits_{i=1}^{n}\Psi(x_{i})G(x_{i})\over\sum\limits_{i=1}^{n} G(x_{i})}\right)\,\,(x_{1},\ldots,x_{n} \in I) ¶was solved by Bajraktarevi' [3] for a fixed n 3 3 n\ge 3 . Assuming that the functions involved are twice differentiable he proved that the above functional equation holds if and only if¶¶Y(x) = [(aF(x) + b)/(cF(x) + d)],       G(x) = kF(x)(cF(x) + d) \Psi(x) = {a\Phi(x)\,+\,b\over c\Phi(x)\,+\,d},\qquad G(x) = kF(x)(c\Phi(x) + d) ¶where a,b,c,d,k are arbitrary constants with k(c²+d²)(ad-bc) 1 0 k(c^2+d^2)(ad-bc)\ne 0 . Supposing the functional equation for all n = 2,3,... n = 2,3,\dots Aczél and Daróczy [2] obtained the same result without differentiability conditions.¶The case of fixed n = 2 is, as in many similar problems, much more difficult and allows considerably more solutions. Here we assume only that the same functional equation is satisfied for n = 2 and solve it under the supposition that the functions involved are six times differentiable. Our main tool is the deduction of a sixth order differential equation for the function j = F°Y^-1 \varphi = \Phi\circ\Psi^{-1} . We get 32 new families of solutions.     

On properties of entire solutions of linear differential equations with polynomial coefficients

We investigate properties of entire solutions of differential equations of the form

Connected Domination Number of a Graph and its Complement

A set S of vertices in a graph G is a connected dominating set if every vertex not in S is adjacent to some vertex in S and the subgraph induced by S is connected. The connected domination number γ _c (G) is the minimum size of such a set. Let d^*(G)=min{d(G),d([`(G)])}{\delta^*(G)={\rm min}\{\delta(G),\delta({\overline{G}})\}} , where [`(G)]{{\overline{G}}} is the complement of G and δ(G) is the minimum vertex degree. We prove that when G and [`(G)]{{\overline{G}}} are both connected, g<sub>c</sub>(G)+g<sub>c</sub>([`(G)]) ￡ d^*(G)+4-(g_c(G)-3)(g_c([`(G)])-3){{\gamma_c}(G)+{\gamma_c}({\overline{G}})\le \delta^*(G)+4-({\gamma_c}(G)-3)({\gamma_c}({\overline{G}})-3)} . As a corollary, g<sub>c</sub>(G)+g<sub>c</sub>([`(G)]) ￡ \frac3n4{{\gamma_c}(G)+{\gamma_c}({\overline{G}})\le \frac{3n}{4}} when δ*(G) ≥ 3 and n ≥ 14, where G has n vertices. We also prove that g_c(G)+g_c([`(G)]) ￡ d<sup>*</sup>(G)+2{{\gamma_c}(G)+{\gamma_c}({\overline{G}})\le \delta^*(G)+2} when g<sub>c</sub>(G),g<sub>c</sub>([`(G)]) 3 4{{\gamma_c}(G),{\gamma_c}({\overline{G}})\ge 4} . This bound is sharp when δ*(G) = 6, and equality can only hold when δ*(G) = 6. Finally, we prove that g_c(G)g_c([`(G)]) ￡ 2n-4{{\gamma_c}(G){\gamma_c}({\overline{G}})\le 2n-4} when n ≥ 7, with equality only for paths and cycles.     

Preservation of Absolutely Continuous Spectrum of?Periodic Jacobi Operators Under Perturbations of?Square-Summable Variation

We study self-adjoint bounded Jacobi operators of the form:

How quadratic are the natural numbers?

Abstract. For natural numbers n we inspect all factorizations n = ab of n with a ￡ ba \le b in \Bbb N\Bbb N and denote by n=a_n b_nn=a_n b_n the most quadratic one, i.e. such that b_n - a_nb_n - a_n is minimal. Then the quotient k(n) : = a_n/b_n\kappa (n) := a_n/b_n is a measure for the quadraticity of n. The best general estimate for k(n)\kappa (n) is of course very poor: 1/n ￡ k(n) ￡ 11/n \le \kappa (n)\le 1. But a Theorem of Hall and Tenenbaum [1, p. 29], implies(logn)^-d-e ￡ k(n) ￡ (logn)^-d(\log n)^{-\delta -\varepsilon } \le \kappa (n) \le (\log n)^{-\delta } on average, with d = 1 - (1+log₂  2)/log2=0,08607 ?\delta = 1 - (1+\log _2 \,2)/\log 2=0,08607 \ldots and for every e > 0\varepsilon >0. Hence the natural numbers are fairly quadratic.¶k(n)\kappa (n) characterizes a specific optimal factorization of n. A quadraticity measure, which is more global with respect to the prime factorization of n, is k^*(n): = ?_{1 ￡ a ￡ b, ab=n} a/b\kappa ^*(n):= \textstyle\sum\limits \limits _{1\le a \le b, ab=n} a/b. We show k^*(n) ~ \frac 12\kappa ^*(n) \sim \frac {1}{2} on average, and k^*(n)=W(2^{\frac 12(1-e) log n/log ₂n})\kappa ^*(n)=\Omega (2^{\frac {1}{2}(1-\varepsilon ) {\log}\, n/{\log} _2n})for every e > 0\varepsilon>0.     

Pan-H-Linked Graphs

Let H be a multigraph, possibly containing loops. An H-subdivision is any simple graph obtained by replacing the edges of H with paths of arbitrary length. Let H be an arbitrary multigraph of order k, size m, n ₀(H) isolated vertices and n ₁(H) vertices of degree one. In Gould and Whalen (Graphs Comb. 23:165–182, 2007) it was shown that if G is a simple graph of order n containing an H-subdivision H{\mathcal{H}} and d(G) 3 \fracn+m-k+n₁(H)+2n₀(H)2{\delta(G) \ge \frac{n+m-k+n_1(H)+2n_0(H)}{2}}, then G contains a spanning H-subdivision with the same ground set as H{\mathcal{H}} . As a corollary to this result, the authors were able to obtain Dirac’s famed theorem on hamiltonian graphs; namely that if G is a graph of order n ≥ 3 with d(G) 3 \fracn2{\delta(G)\ge\frac{n}{2}} , then G is hamiltonian. Bondy (J. Comb. Theory Ser. B 11:80–84, 1971) extended Dirac’s theorem by showing that if G satisfied the condition d(G) 3 \fracn2{\delta(G) \ge \frac{n}{2}} then G was either pancyclic or a complete bipartite graph. In this paper, we extend the result from Gould and Whalen (Graphs Comb. 23:165–182, 2007) in a similar manner. An H-subdivision H{\mathcal{H}} in G is 1-extendible if there exists an H-subdivision H^*{\mathcal{H}^{*}} with the same ground set as H{\mathcal{H}} and |H^*| = |H| + 1{|\mathcal{H}^{*}| = |\mathcal{H}| + 1} . If every H-subdivision in G is 1-extendible, then G is pan-H-linked. We demonstrate that if H is sufficiently dense and G is a graph of large enough order n such that d(G) 3 \fracn+m-k+n₁(H)+2n₀(H)2{\delta(G) \ge \frac{n+m-k+n_1(H)+2n_0(H)}{2}} , then G is pan-H-linked. This result is sharp.     

Hook Lengths and 3-Cores

Recently, the first author generalized a formula of Nekrasov and Okounkov which gives a combinatorial formula, in terms of hook lengths of partitions, for the coefficients of certain power series. In the course of this investigation, he conjectured that a(n) = 0 if and only if b(n) = 0, where integers a(n) and b(n) are defined by

Type II Hermite�CPad�� Approximations of Generalized Hypergeometric Series

We shall present short proofs for type II (simultaneous) Hermite–Padé approximations of the generalized hypergeometric and q-hypergeometric series