共查询到20条相似文献,搜索用时 62 毫秒
1.
Fukun Zhao Leiga Zhao Yanheng Ding 《Zeitschrift für Angewandte Mathematik und Physik (ZAMP)》2011,15(6):495-511
This paper is concerned with the following periodic Hamiltonian elliptic system
{l-Du+V(x)u=g(x,v) in \mathbbRN,-Dv+V(x)v=f(x,u) in \mathbbRN,u(x)? 0 and v(x)?0 as |x|?¥,\left \{\begin{array}{l}-\Delta u+V(x)u=g(x,v)\, {\rm in }\,\mathbb{R}^N,\\-\Delta v+V(x)v=f(x,u)\, {\rm in }\, \mathbb{R}^N,\\ u(x)\to 0\, {\rm and}\,v(x)\to0\, {\rm as }\,|x|\to\infty,\end{array}\right. 相似文献
2.
For a graph G of order |V(G)| = n and a real-valued mapping
f:V(G)?\mathbbR{f:V(G)\rightarrow\mathbb{R}}, if S ì V(G){S\subset V(G)} then f(S)=?w ? S f(w){f(S)=\sum_{w\in S} f(w)} is called the weight of S under f. The closed (respectively, open) neighborhood sum of f is the maximum weight of a closed (respectively, open) neighborhood under f, that is, NS[f]=max{f(N[v])|v ? V(G)}{NS[f]={\rm max}\{f(N[v])|v \in V(G)\}} and NS(f)=max{f(N(v))|v ? V(G)}{NS(f)={\rm max}\{f(N(v))|v \in V(G)\}}. The closed (respectively, open) lower neighborhood sum of f is the minimum weight of a closed (respectively, open) neighborhood under f, that is, NS-[f]=min{f(N[v])|v ? V(G)}{NS^{-}[f]={\rm min}\{f(N[v])|v\in V(G)\}} and NS-(f)=min{f(N(v))|v ? V(G)}{NS^{-}(f)={\rm min}\{f(N(v))|v\in V(G)\}}. For
W ì \mathbbR{W\subset \mathbb{R}}, the closed and open neighborhood sum parameters are NSW[G]=min{NS[f]|f:V(G)? W{NS_W[G]={\rm min}\{NS[f]|f:V(G)\rightarrow W} is a bijection} and NSW(G)=min{NS(f)|f:V(G)? W{NS_W(G)={\rm min}\{NS(f)|f:V(G)\rightarrow W} is a bijection}. The lower neighbor sum parameters are NS-W[G]=maxNS-[f]|f:V(G)? W{NS^{-}_W[G]={\rm max}NS^{-}[f]|f:V(G)\rightarrow W} is a bijection} and NS-W(G)=maxNS-(f)|f:V(G)? W{NS^{-}_W(G)={\rm max}NS^{-}(f)|f:V(G)\rightarrow W} is a bijection}. For bijections f:V(G)? {1,2,?,n}{f:V(G)\rightarrow \{1,2,\ldots,n\}} we consider the parameters NS[G], NS(G), NS
−[G] and NS
−(G), as well as two parameters minimizing the maximum difference in neighborhood sums. 相似文献
3.
Takuro Fukunaga 《Graphs and Combinatorics》2011,27(5):647-659
An undirected graph G = (V, E) is called
\mathbbZ3{\mathbb{Z}_3}-connected if for all
b: V ? \mathbbZ3{b: V \rightarrow \mathbb{Z}_3} with ?v ? Vb(v)=0{\sum_{v \in V}b(v)=0}, an orientation D = (V, A) of G has a
\mathbbZ3{\mathbb{Z}_3}-valued nowhere-zero flow
f: A? \mathbbZ3-{0}{f: A\rightarrow \mathbb{Z}_3-\{0\}} such that ?e ? d+(v)f(e)-?e ? d-(v)f(e)=b(v){\sum_{e \in \delta^+(v)}f(e)-\sum_{e \in \delta^-(v)}f(e)=b(v)} for all v ? V{v \in V}. We show that all 4-edge-connected HHD-free graphs are
\mathbbZ3{\mathbb{Z}_3}-connected. This extends the result due to Lai (Graphs Comb 16:165–176, 2000), which proves the
\mathbbZ3{\mathbb{Z}_3}-connectivity for 4-edge-connected chordal graphs. 相似文献
4.
Let G = (V, E) be an interval graph with n vertices and m edges. A positive integer R(x) is associated with every vertex x ? V{x\in V}. In the conditional covering problem, a vertex x ? V{x \in V} covers a vertex y ? V{y \in V} (x ≠ y) if d(x, y) ≤ R(x) where d(x, y) is the shortest distance between the vertices x and y. The conditional covering problem (CCP) finds a minimum cardinality vertex set C í V{C\subseteq V} so as to cover all the vertices of the graph and every vertex in C is also covered by another vertex of C. This problem is NP-complete for general graphs. In this paper, we propose an efficient algorithm to solve the CCP with nonuniform
coverage radius in O(n
2) time, when G is an interval graph containing n vertices. 相似文献
5.
Kewen Zhao 《Monatshefte für Mathematik》2009,20(1):279-293
Let G be a simple graph with n vertices. For any v ? V(G){v \in V(G)} , let N(v)={u ? V(G): uv ? E(G)}{N(v)=\{u \in V(G): uv \in E(G)\}} , NC(G) = min{|N(u) èN(v)|: u, v ? V(G){NC(G)= \min \{|N(u) \cup N(v)|: u, v \in V(G)} and
uv \not ? E(G)}{uv \not \in E(G)\}} , and NC2(G) = min{|N(u) èN(v)|: u, v ? V(G){NC_2(G)= \min\{|N(u) \cup N(v)|: u, v \in V(G)} and u and v has distance 2 in E(G)}. Let l ≥ 1 be an integer. A graph G on n ≥ l vertices is [l, n]-pan-connected if for any u, v ? V(G){u, v \in V(G)} , and any integer m with l ≤ m ≤ n, G has a (u, v)-path of length m. In 1998, Wei and Zhu (Graphs Combinatorics 14:263–274, 1998) proved that for a three-connected graph on n ≥ 7 vertices, if NC(G) ≥ n − δ(G) + 1, then G is [6, n]-pan-connected. They conjectured that such graphs should be [5, n]-pan-connected. In this paper, we prove that for a three-connected graph on n ≥ 7 vertices, if NC
2(G) ≥ n − δ(G) + 1, then G is [5, n]-pan-connected. Consequently, the conjecture of Wei and Zhu is proved as NC
2(G) ≥ NC(G). Furthermore, we show that the lower bound is best possible and characterize all 2-connected graphs with NC
2(G) ≥ n − δ(G) + 1 which are not [4, n]-pan-connected. 相似文献
6.
Jiabao Su 《Zeitschrift für Angewandte Mathematik und Physik (ZAMP)》2012,21(2):51-62
We study the existence and multiplicity of nontrivial radial solutions of the quasilinear equation
|