三圈图的无符号拉普拉斯谱半径

假设图G的点集是V(G)={v_1,v_2,…,v_n},用d_(v_i)(G)表示图G中点v_i的度,令A(G)表示G的邻接矩阵,D(G)是对角线上元素等于d_(v_i)(G)的n×n对角矩阵,Q(G)=D(G)+A(G)是G的无符号拉普拉斯矩阵,Q(G)的最大特征值是G的无符号拉普拉斯谱半径.现确定了所有点数为n的三圈图中无符号拉普拉斯谱半径最大的图的结构.     

A Bishop–Phelps–Bollobás Theorem for Asplund Operators

By characterizing Asplund operators through Fréchet differentiability property of convex functions, we show the following Bishop–Phelps–Bollobás theorem: Suppose that X is a Banach space,T : X → C(K) is an Asplund operator with ║T║= 1, and that x_0 ∈ S_X, 0 ε satisfy ║T(x_0)║ 1-ε~2/2.Then there exist x_ε∈ S_X and an Asplund operator S : X → C(K) of norm one so that ║S(x_ε)║ = 1, x_0-x_ε ε and ║T-S║ ε.Making use of this theorem, we further show a dual version of Bishop–Phelps–Bollobás property for a strong Radon–Nikodym operator T : ?_1 → Y of norm one: Suppose that y_0~*∈ S_(Y~*), ε≥ 0 satisfy T~*(y_0~*) 1-ε~2/2. Then there exist y_ε~*∈ S_(Y~*), x_ε∈(±e_n), y_ε∈ S_Y, and a strong Radon–Nikodym operator S : ?_1 → Y of norm one so that (ⅰ)║S(x_ε)║= 1;(ⅱ) S(x_ε) = y_ε;(ⅲ)║T-S║ ε;(ⅳ)║S~*(y_ε~*)║=y_ε~*, y_ε= 1;(ⅴ)║y_0~*-y_ε~*║ ε and (ⅵ)║T~*-S~*║ ε,where(e_n) denotes the standard unit vector basis of ?_1.     

不含5-圈和相邻4-圈的平面图的线性2-荫度的一个上界

图G的一个边分解是指将G分解成子图G_1,G_2,…,G_m使得E(G)=E(G_1)=∪E(G_2)∪…∪E(G_m),且对于i≠j,E(G_i)∩E(G_j)=?.一个线性k-森林是指每个分支都是长度最多为k的路的图.图G的线性k-荫度la_k(G)是使得G可以边分解为m个线性k-森林的最小整数m.显然,la_1(G)是G的边色数χ'(G); la_∞(G)表示每条分支路是无限长度时的情况,即通常所说的G的线性荫度la(G).利用权转移的方法研究平面图的线性2-荫度la_2(G).设G是不含有5-圈和相邻4-圈的平面图,证明了若G连通且δ(G)≥2,则G包含一条边xy使得d(x)+d(y)≤8或包含一个2-交错圈.根据这一结果得到其线性2-荫度的上界为[△/2]+4.     

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.     

On a novel eccentricity-based invariant of a graph

In this paper,for the purpose of measuring the non-self-centrality extent of non-selfcentered graphs,a novel eccentricity-based invariant,named as non-self-centrality number(NSC number for short),of a graph G is defined as follows:N(G)=∑v_i,v_j∈V(G)|e_i-e_j| where the summation goes over all the unordered pairs of vertices in G and e_i is the eccentricity of vertex v_i in G,whereas the invariant will be called third Zagreb eccentricity index if the summation only goes over the adjacent vertex pairs of graph G.In this paper,we determine the lower and upper bounds on N(G) and characterize the corresponding graphs at which the lower and upper bounds are attained.Finally we propose some attractive research topics for this new invariant of graphs.     

On Graph-Lagrangians and clique numbers of 3-uniform hypergraphs

The paper explores the connection of Graph-Lagrangians and its maximum cliques for 3-uniform hypergraphs.Motzkin and Straus showed that the Graph-Lagrangian of a graph is the Graph-Lagrangian of its maximum cliques.This connection provided a new proof of Turán classical result on the Turán density of complete graphs.Since then,Graph-Lagrangian has become a useful tool in extremal problems for hypergraphs.Peng and Zhao attempted to explore the relationship between the Graph-Lagrangian of a hypergraph and the order of its maximum cliques for hypergraphs when the number of edges is in certain range.They showed that if G is a 3-uniform graph with m edges containing a clique of order t-1,then λ(G)=λ([t-1]~((3))) provided (t-13)≤m≤(t-13)+_(t-22).They also conjectured:If G is an r-uniform graph with m edges not containing a clique of order t-1,then λ(G)λ([t-1]~((r))) provided (t-1r)≤ m ≤(t-1r)+(t-2r-1).It has been shown that to verify this conjecture for 3-uniform graphs,it is sufficient to verify the conjecture for left-compressed 3-uniform graphs with m=t-13+t-22.Regarding this conjecture,we show: If G is a left-compressed 3-uniform graph on the vertex set [t] with m edges and |[t-1]~((3))\E(G)|=p,then λ(G)λ([t-1]~((3))) provided m=(t-13)+(t-22) and t≥17p/2+11.     

形式矩阵环上的σ-双导子和σ-交换映射

令(R N M S)是一个具有零迹理想的形式矩阵环,σ是K的一个满足σ(E₁₁)=E₁₁,σ(E₂₂)=E₂₂的自同构.本文确定了K的σ-双导子和σ-交换映射的一般形式,证明了在一定条件下K的每个σ-双导子都可以表示成一个外σ-双导子与一个内σ-双导子的和.此外,本文给出了K的任意σ-双导子(σ-交换映射)是内σ-双导子(真σ-交换映射)的一个充分条件.     

Number of minimum vertex cuts in transitive graphs

Let G be a k-regular vertex transitive graph with connectivity κ(G)=k and let m_k(G) be the number of vertex cuts with k vertices. Define m(n,k)=min{m_k(G): GT_n,k}, where T_n,k denotes the set of all k-regular vertex transitive graphs on n vertices with κ(G)=k. In this paper, we determine the exact values of m(n,k).     

von Neumann代数上的局部可乘Lie n-导子

A₁，…，A_n的（n-1）-换位子记为p_n（A₁，…，A_n）.令M是von Neumann代数，n ≥ 2是任意正整数，L：M → M是一个映射.本文证明了，若M不含I₁型中心直和项，且L满足L（p_n（A₁，…，A_n））=∑_k=1ⁿ p_n（A₁，…，A_k-1，L（A_k），A_k+1，…，A_n）对所有满足条件A₁A₂=0的A₁，A₂，…，A_n ∈ M成立，则L（A）=φ（A）+f（A）对所有A ∈ M成立，其中φ：M → M和f：M → Z（M）（M的中心）是两个映射，且满足φ在P_iMP_j上是可加导子，f（p_n（A₁，A₂，…，A_n））=0对所有满足A₁A₂=0的A₁，A₂，…，A_n ∈ P_iMP_j成立（1 ≤ i，j ≤ 2），P₁ ∈ M是core-free投影，P₂=I-P₁；若M还是因子且n ≥ 3，则L满足条件L（p_n（A₁，A₂，…，A_n））=∑_k=1ⁿ p_n（A₁，…，A_k-1，L（A_k），A_k+1，…，A_n）对所有满足A₁A₂A₁=0的A₁，A₂，…，A_n ∈ M成立当且仅当L（A）=φ（A）+h（A）I对所有A ∈ M成立，其中φ是M上的可加导子，h是M上的泛函且满足h（p_n（A₁，A₂，…，A_n））=0对所有满足条件A₁A₂A₁=0的A₁，A₂，…，A_n ∈ M成立.     

树按Balaban指标的排序(英文)

连通图G的Balaban指标(也称J指标)定义为J=J(G)=(|E(G)|)/μ+1∑_(uυ∈E(G)),其中σ_G(u)=∑(w∈V(G)d_G(u,w)此处μ是基圈数.Balaban指标常用于各种QSAR和QSPR的研究.本文根据Balaban指标的计算公式及文中提到的变换方式,我们得到了一些序关系.基于这些序关系,我们确定了n个顶点的树中具有最小Balaban指标的前21个树.     

An Improved Upper Bound on the Linear 2-arboricity of 1-planar Graphs

The linear 2-arboricity la_2(G) of a graph G is the least integer k such that G can be partitioned into k edge-disjoint forests,whose component trees are paths of length at most 2.In this paper,we prove that if G is a 1-planar graph with maximum degree Δ,then la_2(G)≤[(Δ+1)/2]+7.This improves a known result of Liu et al.(2019) that every 1-planar graph G has la_2(G)≤[(Δ+1)/2]+14.We also observe that there exists a 7-regular 1-planar graph G such that la_2(G)=6=[(Δ+1)/2]+2,which implies that our solution is within 6 from optimal.     

图的k部划分的一个注记

设k≥2是一个整数。本文证明了任意有m条边的图都存在一个顶点的划分V_1,V_2…,V_k,使得e(V_1,V_2…,V_k)≥k-1/k m+k-1/2k((2m+1/4)~1/2-1/2)-(k-2)~2/8k,且max{e(V_i):1≤i≤k}≤m/k~2+(k-1)/2k~2((2m+1/4)~1/2-1/2+3/8-7k-4/8k~2.我们的结果改进了[Fan G.,Hou J.,Zeng Q.,A bound for judicious k-partitions of graphs,Discrete Appl.Math.,2014,179:86—99]的主要结论.     

相依误差广义线性模型的M估计的Bahadur表示

考虑如下广义线性模型y_i=h(x~T_i,β)+e_i=1,2,…,n,其中e_i=G(…,ε_(i-1),ε_i),h是一个连续可导函数,ε_i是独立同分布的随机变量,并且它的期望为0,方差σ~2有限.本文给出了参数β的M估计,并且得到了该估计的Bahadur表示,该结论推广了线性模型的相关结论.应用M估计的Bahadur表示,得到了相依误差的线性回归模型,poisson模型,logistic模型和独立误差的广义线性模型等模型的渐近性质.     

离散型p次Dirichlet型第一特征值

设μ=(μ_i)_i≥0为Z_+上的测度且p 1,考虑下述离散型p次Dirichlet型D_p(f)=Σ_(i=0)~∞μ_ib_i(f_i-f_(i+1))(f_i~(p-1)-f_(i+1)~(p-1)),f≥0,其中(b_i)_(i≥0)为Z_+上的正序列.本文旨在给出空间L~p(μ)上p次Dirichlet型D_p(f)所对应的第一特征值λ_(0,p)=inf{D_p(f):‖f‖_p=1,f非负且具有紧支撑}的上下界精细估计.     

Zagreb indices of graphs

The first Zagreb index M₁(G) is equal to the sum of squares of the degrees of the vertices, and the second Zagreb index M₂(G) is equal to the sum of the products of the degrees of pairs of adjacent vertices of the underlying molecular graph G. In this paper, we obtain lower and upper bounds on the first Zagreb index M₁(G) of G in terms of the number of vertices (n), number of edges (m), maximum vertex degree (Δ), and minimum vertex degree (δ). Using this result, we find lower and upper bounds on M₂(G). Also, we present lower and upper bounds on M₂(G) +M₂(G) in terms of n, m, Δ, and δ, where G denotes the complement of G. Moreover, we determine the bounds on first Zagreb coindex M₁(G) and second Zagreb coindex M₂(G). Finally, we give a relation between the first Zagreb index and the second Zagreb index of graph G.     

多扇图的Pebbling数和Graham猜想

图G的pebbling数f(G)是最小的整数n,使得不论n个pebble如何放置在G的顶点上,总可以通过一系列的pebbling移动把1个pebble移到任意一个顶点上,其中一个pebbling移动是从一个顶点处移走两个pebble而把其中的一个移到与其相邻的一个顶点上。Graham猜想对于任意的连通图G和H有f(G×H)f(G)f(H)。多扇图F_n1,n2,…,nm是指阶为n₁+n₂+…+n_m+1的联图P₁∨(P_n1∪P_n2∪…∪P_nm)。本文首先给出了多扇图的pebbling数,然后证明了多扇图F_n1,n2,…,nm具有2-pebbling性质,最后论述了对于一个多扇图和一个具有2-pebbling性质的图的乘积来说,Graham猜想是成立的。作为一个推论,当G和H都是多扇图时,Graham猜想成立。     

Context-free grammars for triangular arrays

We consider context-free grammars of the form G = {f → fb1+b2+1ga1+a2, g → fb1 ga1+1},where ai and bi are integers sub ject to certain positivity conditions. Such a grammar G gives rise to triangular arrays {T(n, k)}0≤k≤n satisfying a three-term recurrence relation. Many combinatorial sequences can be generated in this way. Let Tn (x) =∑nk=0T(n, k)xk. Based on the differential operator with respect to G, we define a sequence of linear operators Pn such that Tn+1(x) = Pn(Tn(x)). Applying the characterization of real stability preserving linear operators on the multivariate polynomials due to Borcea and Br?ndén, we obtain a necessary and sufficient condition for the operator Pn to be real stability preserving for any n. As a consequence, we are led to a sufficient condition for the real-rootedness of the polynomials defined by certain triangular arrays, obtained by Wang and Yeh.Moreover, as special cases we obtain grammars that lead to identities involving the Whitney numbers and the Bessel numbers.     

界约束下算子方程最小二乘问题的条件梯度法

研究如下界约束下算子方程最小二乘问题:min x∈Ω‖L(X:A_1,…,At;B_1,…,B_t)-T‖~2,其中‖.‖为Frobenius范数,L(X:A_1…A_t;B_1,…,B_t)为关于X的线性矩阵算子(或齐次线性变换),Ai∈R~(p×m),B_j∈R~(n×q)i,j=1,…,n为算子L的系数矩阵,丁为右端矩阵,ΩR~(m×n)为界约束凸集合.提出了求解问题的条件梯度迭代算法及其简要收敛性分析,并给出条件梯度算法的几类加速形式.随机数据和图像恢复模型数据的实验结果表明说明算法是可行高效的.     

完全多部图的无符号Laplacian特征多项式(英文)

For a simple graph G,let matrix Q（G）=D（G） + A（G） be it’s signless Laplacian matrix and Q G （λ）=det（λI Q） it’s signless Laplacian characteristic polynomial,where D（G） denotes the diagonal matrix of vertex degrees of G,A（G） denotes its adjacency matrix of G.If all eigenvalues of Q G （λ） are integral,then the graph G is called Q-integral.In this paper,we obtain that the signless Laplacian characteristic polynomials of the complete multi-partite graphs G=K（n₁,n₂,···,n_t）.We prove that the complete t-partite graphs K（n,n,···,n）t are Q-integral and give a necessary and sufficient condition for the complete multipartite graphs K（m,···,m）s（n,···,n）t to be Q-integral.We also obtain that the signless Laplacian characteristic polynomials of the complete multipartite graphs K（m,···,m,）s1（n,···,n,）s2（l,···,l）s3.     

与Smarandache函数有关的一个方程的解的注记

设φ(n)、S(n)分别表示正整数n的Euler函数和Smarandache函数,白海荣和廖群英在[Smarandache函数的几类相关方程的解,数学学报中文版,2019,62(2):247-254]中称方程φ(n)=∑d|nS(d)只有两个解,分别为n=2^5和n=3×2^5.本文指出,这两个数均不是此方程的解,并指出其出错原因是因为他们对M?bius反转公式的错误理解所造成的.