Degree Conditions for k-Hamiltonian [a,b]-factors

Let a,b,k be nonnegative integers with 2≤a相似文献   

An implicit degree ore-condition for pancyclicity of graphs

In 1989, Zhu, Li and Deng introduced the definition of implicit degree of a vertex v in a graph G, denoted by id(v). In this paper, we prove that if G is a 2-connected graph of order n such that id(u) + id(v) ≥ n for each pair of nonadjacent vertices u and v in G, then G is pancyclic unless G is bipartite, or else n = 4r, r ≥ 2 and G is isomorphic to F4r .     

Hamilton连通图的一个充分条件

Let G be a3-connected graph with n vertices.The paper proves that if for each pair of verti-ces u and v of G,d(u,v)=2,has|N(u)∩N(v)|≤α（αis the minimum independent set num-ber),and then max{d(u),d(v)|≥n 1/2,then G is a Hamilton connected graph.     

The Rainbow Vertex-disconnection in Graphs

Let G be a nontrivial connected and vertex-colored graph. A subset X of the vertex set of G is called rainbow if any two vertices in X have distinct colors. The graph G is called rainbow vertex-disconnected if for any two vertices x and y of G, there exists a vertex subset S of G such that when x and y are nonadjacent, S is rainbow and x and y belong to different components of G-S; whereas when x and y are adjacent, S + x or S + y is rainbow and x and y belong to different components of(G-xy)-S. For a connected graph G, the rainbow vertex-disconnection number of G, denoted by rvd(G), is the minimum number of colors that are needed to make G rainbow vertexdisconnected. In this paper, we characterize all graphs of order n with rainbow vertex-disconnection number k for k ∈ {1, 2, n}, and determine the rainbow vertex-disconnection numbers of some special graphs. Moreover, we study the extremal problems on the number of edges of a connected graph G with order n and rvd(G) = k for given integers k and n with 1 ≤ k ≤ n.     

The fractional metric dimension of permutation graphs

Let G =(V(G), E(G)) be a graph with vertex set V(G) and edge set E(G). For two distinct vertices x and y of a graph G, let RG{x, y} denote the set of vertices z such that the distance from x to z is not equa l to the distance from y to z in G. For a function g defined on V(G) and for U■V(G), let g(U) =∑s∈Ug(s). A real-valued function g : V(G) → [0, 1] is a resolving function of G if g(RG{x, y}) ≥ 1 for any two distinct vertices x, y ∈ V(G). The fractional metric dimension dimf(G)of a graph G is min{g(V(G)) : g is a resolving function of G}. Let G1 and G2 be disjoint copies of a graph G, and let σ : V(G1) → V(G2) be a bijection. Then, a permutation graph Gσ =(V, E) has the vertex set V = V(G1) ∪ V(G2) and the edge set E = E(G1) ∪ E(G2) ∪ {uv | v = σ(u)}. First,we determine dimf(T) for any tree T. We show that 1 dimf(Gσ) ≤1/2(|V(G)| + |S(G)|) for any connected graph G of order at least 3, where S(G) denotes the set of support vertices of G. We also show that, for any ε 0, there exists a permutation graph Gσ such that dimf(Gσ)- 1 ε. We give examples showing that neither is there a function h1 such that dimf(G) h1(dimf(Gσ)) for all pairs(G, σ), nor is there a function h2 such that h2(dimf(G)) dimf(Gσ) for all pairs(G, σ). Furthermore,we investigate dimf(Gσ) when G is a complete k-partite graph or a cycle.     

A class of antimagic join graphs

A labeling f of a graph G is a bijection from its edge set E(G) to the set {1, 2, . . . , |E(G)|}, which is antimagic if for any distinct vertices x and y, the sum of the labels on edges incident to x is different from the sum of the labels on edges incident to y. A graph G is antimagic if G has an f which is antimagic. Hartsfield and Ringel conjectured in 1990 that every connected graph other than K 2 is antimagic. In this paper, we show that if G 1 is an n-vertex graph with minimum degree at least r, and G 2 is an m-vertex graph with maximum degree at most 2r-1 (m ≥ n), then G1 ∨ G2 is antimagic.     

The Classification of Connected Imprimitive Arc-transitive Graphs on Zp × Zp

The term (di)graph is employed to mean that a graph in question is either a directed graph or an undirected graph. The symbol G(p, r) represents the digraph defined by Chao[1]:V(G(p,r)) = Zp, E(G(p,r)) = {(x,y)|x - y ∈ Hr}, where p is a prime, r is a positive divisor of p - 1 and Hr is the unique subgroup of order r in Aut(Zp).     

NEIGHBORHOOD UNION OF INDEPENDENT SETS AND HAMILTONICITY OF CLAW-FREE GRAPHS

Let G be a graph,for any u∈V(G),let N(u) denote the neighborhood of u and d(u)=|N(u)| be the degree of u. For any U V(G) ,let N(U)=Uu,∈UN(u), and d(U)=|N(U)|.A graph G is called claw-free if it has no induced subgraph isomorphic to K1.3. One of the fundamental results concerning cycles in claw-free graphs is due to Tian Feng,et al. : Let G be a 2-connected claw-free graph of order n,and d(u) d(v) d(w)≥n-2 for every independent vertex set {u,v,w} of G, then G is Hamiltonian. It is proved that, for any three positive integers s ,t and w,such that if G is a (s t w-1)connected claw-free graph of order n,and d(S) d(T) d(W)＞n-(s t w) for every three disjoint independent vertex sets S,T,W with |S |=s, |T|=t, |W|=w,and S∪T∪W is also independent ,then G is Hamiltonian. Other related results are obtained too.     

Frequency Assignment through Combinatorial Optimization Approach

An L(2,1)-labeling of a graph G is a function f from the vertex set V(G) to the set of all nonnegative integers such that |f(x)-f(y)|(?)2 if d(x, y)=1 and |f(x)-f(y)|(?)1 if d(x,y)=2. The L(2,1)-labeling numberλ(G) of G is the smallest number k such that G has an L(2,1)-labeling with max{f(v) : v∈V(G)}=k. We study the L(3,2,1)-labeling which is a generalization of the L(2,1)-labeling on the graph formed by the (Cartesian) product and composition of 3 graphs and derive the upper bounds ofλs(G) of the graph.     

On the adjacent-vertex-strongly-distinguishing total coloring of graphs

For any vertex u∈V(G), let T_N(U)={u}∪{uv|uv∈E(G), v∈v(G)}∪{v∈v(G)|uv∈E(G)}and let f be a total k-coloring of G. The total-color neighbor of a vertex u of G is the color set C_f(u)={f(x)|x∈TN(U)}. For any two adjacent vertices x and y of V(G)such that C_f(x)≠C_f(y), we refer to f as a k-avsdt-coloring of G("avsdt"is the abbreviation of"adjacent-vertex-strongly- distinguishing total"). The avsdt-coloring number of G, denoted by X_(ast)(G), is the minimal number of colors required for a avsdt-coloring of G. In this paper, the avsdt-coloring numbers on some familiar graphs are studied, such as paths, cycles, complete graphs, complete bipartite graphs and so on. We proveΔ(G) 1≤X_(ast)(G)≤Δ(G) 2 for any tree or unique cycle graph G.     

半无爪可迹图的度和条件

可迹图即为一个含有Hamilton路的图.令$N[v]=N(v)\cup\{v\}$, $J(u,v)=\{w\in N(u)\cap N(v):N(w)\subseteq N[u]\cup N[v]\}$.若图中任意距离为2的两点$u,v$满足$J(u,v)\neq \emptyset$,则称该图为半无爪图.令$\sigma_{k}(G)=\min\{\sum_{v\in S}d(v):S$为$G$中含有$k$个点的独立集\},其中$d(v)$表示图$G$中顶点$v$的度.本论文证明了若图$G$为一个阶数为$n$的连通半无爪图,且$\sigma_{3}(G)\geq {n-2}$,则图$G$为可迹图; 文中给出一个图例,说明上述结果中的界是下确界; 此外,我们证明了若图$G$为一个阶数为$n$的连通半无爪图,且$\sigma_{2}(G)\geq \frac{2({n-2})}{3}$,则该图为可迹图.     

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.     

划分围长至少为6 的平面图为有界大小的分支

图$G$的$(\mathcal{O}_{k_1}, \mathcal{O}_{k_2})$-划分是将$V(G)$划分成两个非空子集$V_{1}$和$V_{2}$, 使得$G[V_{1}]$和$G[V_{2}]$分别是分支的阶数至多$k_1$和$k_2$的图.在本文中,我们考虑了有围长限制的平面图的点集划分问题,使得每个部分导出一个具有有界大小分支的图.我们证明了每一个围长至少为6并且$i$-圈不与$j$-圈相交的平面图允许$(\mathcal{O}_{2}$, $\mathcal{O}_{3})$-划分,其中$i\in\{6,7,8\}$和$j\in\{6,7,8,9\}$.     

参数函数$\epsilon$取边际值时的$GCF_\epsilon$集

Let ∈ :N → R be a parameter function satisfying the condition ∈(k) + k + 1 > 0and let T∈ :(0,1] →(0,1] be a transformation defined by T∈(x) =-1 +(k + 1)x1 + k-k∈x for x ∈(1k + 1,1k].Under the algorithm T∈,every x ∈(0,1] is attached an expansion,called generalized continued fraction(GCF∈) expansion with parameters by Schweiger.Define the sequence {kn(x)}n≥1of the partial quotients of x by k1(x) = ∈1/x∈ and kn(x) = k1(Tn-1∈(x)) for every n ≥ 2.Under the restriction-k-1 < ∈(k) <-k,define the set of non-recurring GCF∈expansions as F∈= {x ∈(0,1] :kn+1(x) > kn(x) for infinitely many n}.It has been proved by Schweiger that F∈has Lebesgue measure 0.In the present paper,we strengthen this result by showing that{dim H F∈≥12,when ∈(k) =-k-1 + ρ for a constant 0 < ρ < 1;1s+2≤ dimHF∈≤1s,when ∈(k) =-k-1 +1ksfor any s ≥ 1where dim H denotes the Hausdorff dimension.     

New Class of Kirchhoff Type Equations with Kelvin-Voigt Damping and General Nonlinearity: Local Existence and Blow-up in Solutions

In this paper, we consider a class of Kirchhoff equation, in the presence of a Kelvin-Voigt type damping and a source term of general nonlinearity forms. Where the studied equation is given as follows\begin{equation*}u_{tt} -\mathcal{K}\left( \mathcal{N}u(t)\right)\left[ \Delta_{p(x)}u +\Delta_{r(x)}u_{t}\right]=\mathcal{F}(x, t, u).\end{equation*}Here, $\mathcal{K}\left( \mathcal{N}u(t)\right)$ is a Kirchhoff function, $\Delta_{r(x)}u_{t}$ represent a Kelvin-Voigt strong damping term, and $\mathcal{F}(x, t, u)$ is a source term. According to an appropriate assumption, we obtain the local existence of the weak solutions by applying the Galerkin's approximation method. Furthermore, we prove a non-global existence result for certain solutions with negative/positive initial energy. More precisely, our aim is to find a sufficient conditions for $p(x), q(x), r(x), \mathcal{F}(x,t,u)$ and the initial data for which the blow-up occurs.     

On the Circumference of 2-Connected $$\mathcal{P}_{3}$$-Dominated Graphs

Let G be a connected graph. For at distance 2, we define , and , if then . G is quasi-claw-free if it satisfies , and G is P ₃-dominated() if it satisfies , for every pair (x, y) of vertices at distance 2. Certainly contains as a subclass. In this paper, we prove that the circumference of a 2-connected P ₃-dominated graph G on n vertices is at least min or , moreover if then G is hamiltonian or , where is a class of 2-connected nonhamiltonian graphs.     

平衡子欧拉符号图及符号线图

符号图$S=(S^u,\sigma)$是以$S^u$作为底图并且满足$\sigma: E(S^u)\rightarrow\{+,-\}$. 设$E^-(S)$表示$S$的负边集. 如果$S^u$是欧拉的(或者分别是子欧拉的, 欧拉的且$|E^-(S)|$是偶数, 则$S$是欧拉符号图(或者分别是子欧拉符号图, 平衡欧拉符号图). 如果存在平衡欧拉符号图$S''$使得$S''$由$S$生成, 则$S$是平衡子欧拉符号图. 符号图$S$的线图$L(S)$也是一个符号图, 使得$L(S)$的点是$S$中的边, 其中$e_ie_j$是$L(S)$中的边当且仅当$e_i$和$e_j$在$S$中相邻,并且$e_ie_j$是$L(S)$中的负边当且仅当$e_i$和$e_j$在$S$中都是负边. 本文给出了两个符号图族$S$和$S''$,它们应用于刻画平衡子欧拉符号图和平衡子欧拉符号线图. 特别地, 本文证明了符号图$S$是平衡子欧拉的当且仅当$\not\in S$, $S$的符号线图是平衡子欧拉的当且仅当$S\not\in S''$.     

一列连续函数的遍历优化

设$T:X\rightarrow X$是紧度量空间$X$上的连续映射, $\mathcal{F}=\{f_n\}_{n\geq 1}$是$X$上的一族连续函数. 如果 $\mathcal{F}$是渐近次可加的, 那么$\sup\limits_{x\in \mathrm{Reg}(\mathcal{F},T)}\lim\limits_{n\rightarrow\infty}\frac 1 n f_n (x)=\sup\limits_{x\in X} \limsup\limits_{n\rightarrow\infty}\frac 1 n f_n (x) =\lim\limits_{n\rightarrow\infty}\frac 1 n \max\limits_{x\in X}f_n (x)=\sup\{\mathcal{F}^*(\mu):\mu\in\mathcal{M}_T\}$, 其中$\mathcal{M}_T$表示$T$-\!\!不变的Borel概率测度空间, $\mathrm{Reg}(\mathcal{F},T)$ 表示函数族$\mathcal{F}$的正规点集, $\mathcal{F}^*(\mu)=\lim\limits_{n\rightarrow\infty}\frac 1 n \int f_n \mathrm{d}\mu$. 这把Jenkinson, Schreiber 和 Sturman 等人的一些结果推广到渐近次可加势函数, 并且给出了次可加势函数从属原理成立的充分条件, 最后给出了 一些相关的应用.     

严格上三角矩阵李代数上的积零导子

设$F$ 为域, $n\geq 3$, $\bf{N}$$(n,\mathbb{F})$ 为域$\mathbb{F}$ 上所有$n\times n$ 阶严格上三角矩阵构成的严格上三角矩阵李代数, 其李运算为$[x,y]=xy-yx$. $\bf{N}$$(n, \mathbb{F})$ 上一线性映射$\varphi$ 称为积零导子,如果由$[x,y]=0, x,y\in \bf{N}$$(n,\mathbb{F})$,总可推出 $[\varphi(x), y]+[x,\varphi(y)]=0$. 本文证明 $\bf{N}$$(n,\mathbb{F})$上一线性映射 $\varphi$ 为积零导子当且仅当 $\varphi$ 为$\bf{N}$$(n,\mathbb{F})$ 上内导子, 对角线导子, 极端导子, 中心导子和标量乘法的和.     

一类振荡积分算子在Wiener 共合空间上的有界性

假设a,b0并且K_(a,b)(x)=(e~(i|x|~(-b)))/(|x|~(n+a))定义强奇异卷积算子T如下:Tf(x)=(K_(a,b)*f)(x),本文主要考虑了如上定义的算子T在Wiener共合空间W(FL~p,L~q)(R~n)上的有界性.另一方面,设α,β0并且γ(t)=|t|~k或γ(t)=sgn(t)|t|~k.利用振荡积分估计,本文还研究了算子T_(α,β)f(x,y)=p.v∫_(-1)~1f(x-t,y-γ(t))(e~(2πi|t|~(-β)))/(t|t|~α)dt及其推广形式∧_(α,β)f(x,y,z)=∫_(Q~2)f(x-t,y-s,z-t~ks~j)e~(-2πit)~(-β_1_s-β_2)t~(-α_1-1)s~(-α_2-1)dtds在Wiener共合空间W(FL~p,L~q)上的映射性质.本文的结论足以表明,Wiener共合空间是Lebesgue空间的一个很好的替代.