共查询到20条相似文献,搜索用时 640 毫秒
1.
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. 相似文献
2.
WANGWEIFAN ZHANGKEMIN 《高校应用数学学报(英文版)》1997,12(4):455-462
A Planar graph g is called a ipseudo outerplanar graph if there is a subset v.∈V(G),[V.]=i,such that G-V. is an outerplanar graph in particular when G-V.is a forest ,g is called a i-pseudo-tree .in this paper.the following results are proved;(1)the conjecture on the total coloring is true for all 1-pseudo-outerplanar graphs;(2)X1(G) 1 fo any 1-pseudo outerplanar graph g with △(G)≥3,where x4(G)is the total chromatic number of a graph g. 相似文献
3.
If G has a nilpotent normal p-complement and V is a finite, faithful and completely reducible G-module of characteristic p, we prove that there exist ${v_1, v_2 \in V}If G has a nilpotent normal p-complement and V is a finite, faithful and completely reducible G-module of characteristic p, we prove that there exist v1, v2 ? V{v_1, v_2 \in V} such that CG(v1)?CG(v2) = P{{\bf C}_{G}{(v_1)}\cap {\bf C}_{G}{(v_2)} = P} , where P ? Sylp(G){P \in {\rm Syl}_p(G)} . We hence deduce that, if the normal p-complement K is nontrivial, there exists v ? CV(P){v \in {\bf C}_{V}(P)} such that |K : C
K
(v)|2 > |K|. 相似文献
4.
A Roman dominating function on a graph G = (V, E) is a function f : V ? {0, 1, 2}f : V \rightarrow \{0, 1, 2\} satisfying the condition that every vertex v for which f(v) = 0 is adjacent to at least one vertex u for which f(u) = 2. The weight of a Roman dominating function is the value w(f) = ?v ? V f(v)w(f) = \sum_{v\in V} f(v). The Roman domination number of a graph G, denoted by gR(G)_{\gamma R}(G), equals the minimum weight of a Roman dominating function on G. The Roman domination subdivision number sdgR(G)sd_{\gamma R}(G) is the minimum number of edges that must be subdivided (each edge in G can be subdivided at most once) in order to increase the Roman domination number. In this paper, first we establish upper
bounds on the Roman domination subdivision number for arbitrary graphs in terms of vertex degree. Then we present several
different conditions on G which are sufficient to imply that $1 \leq sd_{\gamma R}(G)
\leq 3$1 \leq sd_{\gamma R}(G)
\leq 3. Finally, we show that the Roman domination subdivision number of a graph can be arbitrarily large. 相似文献
5.
The flag complex of a graph G = (V, E) is the simplicial complex X(G) on the vertex set V whose simplices are subsets of V which span complete subgraphs of G. We study relations between the first eigenvalues of successive higher Laplacians of X(G). One consequence is the following:Theorem: Let λ2(G) denote the second smallest eigenvalue of the Laplacian of G. If
\,\frac{k}{k+1}|V|$$" align="middle" border="0">
then
Applications include a lower bound on the homological connectivity of the independent sets complex I(G), in terms of a new graph domination parameter Γ(G) defined via certain vector representations of G. This in turns implies Hall type theorems for systems of disjoint representatives in hypergraphs.Received: January 2004 Revised: August 2004 Accepted: August 2004 相似文献
6.
We present results on total domination in a partitioned graph G = (V, E). Let γ
t
(G) denote the total dominating number of G. For a partition , k ≥ 2, of V, let γ
t
(G; V
i
) be the cardinality of a smallest subset of V such that every vertex of V
i
has a neighbour in it and define the following
We summarize known bounds on γ
t
(G) and for graphs with all degrees at least δ we derive the following bounds for f
t
(G; k) and g
t
(G; k).
相似文献
(i) | For δ ≥ 2 and k ≥ 3 we prove f t (G; k) ≤ 11|V|/7 and this inequality is best possible. |
(ii) | for δ ≥ 3 we prove that f t (G; 2) ≤ (5/4 − 1/372)|V|. That inequality may not be best possible, but we conjecture that f t (G; 2) ≤ 7|V|/6 is. |
(iii) | for δ ≥ 3 we prove f t (G; k) ≤ 3|V|/2 and this inequality is best possible. |
(iv) | for δ ≥ 3 the inequality g t (G; k) ≤ 3|V|/4 holds and is best possible. |
7.
A Roman dominating function on a graph G is a function f : V(G) → {0, 1, 2} satisfying the condition that every vertex u for which f (u) = 0 is adjacent to at least one vertex v for which f (v) = 2. The weight of a Roman dominating function is the value f (V(G)) = ?u ? V(G) f (u){f (V(G)) = \sum_{u\in V(G)} f (u)}. The Roman domination number, γ
R
(G), of G is the minimum weight of a Roman dominating function on G. The Roman bondage number b
R
(G) of a graph G with maximum degree at least two is the minimum cardinality of all sets E¢ í E(G){E^{\prime} \subseteq E(G)} for which γ
R
(G − E′) > γ
R
(G). In this paper we present different bounds on the Roman bondage number of planar graphs. 相似文献
8.
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. 相似文献
9.
Lutz Volkmann 《Czechoslovak Mathematical Journal》2010,60(1):77-83
Let G be a graph with vertex set V(G), and let k ⩾ 1 be an integer. A subset D ⊆ V(G) is called a k-dominating set if every vertex υ ∈ V(G)-D has at least k neighbors in D. The k-domination number γ
k
(G) of G is the minimum cardinality of a k-dominating set in G. If G is a graph with minimum degree δ(G) ⩾ k + 1, then we prove that
$
\gamma _{k + 1} (G) \leqslant \frac{{|V(G)| + \gamma _k (G)}}
{2}.
$
\gamma _{k + 1} (G) \leqslant \frac{{|V(G)| + \gamma _k (G)}}
{2}.
相似文献
10.
E. Gečiauskas 《Geometriae Dedicata》2006,121(1):9-18
We have obtained a recurrence formula $I_{n+3} = \frac{4(n+3)}{\pi(n+4)}VI_{n+1}
|