New Results on One Modulo N-Difference Mean Graphs

A graph G is said to be one modulo N-difference mean graph if there is an injective function f from the vertex set of G to the set , where N is the natural number and q is the number of edges of G and f induces a bijection from the edge set of G to given by and the function f is called a one modulo N-difference mean labeling of G. In this paper, we show that the graphs such as arbitrary union of paths, , ladder, slanting ladder, diamond snake, quadrilateral snake, alternately quadrilateral snake, , , , , friendship graph and admit one modulo N-difference mean labeling.

On the Gracefulness of Graph(jC_(4n))∪P_m

The present paper deals with the gracefulness of unconnected graph （jC_（4n））∪P_m,and proves the following result：for positive integers n,j and m with n≥1,j≥2,the unconnected graph（jC_（4n））∪P_m is a graceful graph for m=j-1 or m≥n＋j,where C_（4n） is a cycle with 4n vertexes,P_m is a path with m＋1 vertexes,and（jC_（4n））∪P_m denotes the disjoint union of j-C_（4n） and P_m.

On the Gracefulness of Two Family of the Hexagonal Graphs

In the paper,we construct two families of the hexagonal graphs G1 (n) and G2 (n),and prove their gracefulness.

On Odd Arithmetic Graphs

The following results are obtained： （1） The graph Cm^m· Pt is odd arithmetic when （i） m ≡ 0 （mod 2） and t=m or m ＋ 1; （ii） m ≡ 1 （mod 2） and t=m ＋ 1. （2） The graph C2m^m is odd arithmetic when （i） m=2,4 and n is any positive integer; （ii） m=3 and n is even. （3） The graph Cm^m, is odd arithmetic when m=4n and t=2. （4） Pm＋1^n is odd arithmetic when （i） n is odd; （ii） m 〈 3 and n is any positive integer. （5） Windmill graph Kn^t is odd arithmetic if and only if n=2. （6） Cycle Cn is odd arithmetic if and only if n ≡ 0 （mod 4）. （7） For any positive integer n and any positive integer m, Km,n is odd arithmetic.

P_n^3 is a Graceful Graph

Let G(V,E) be a simple graph and G^k be a k-power graph defined byV(G~*) = V(G), E(G^k) = E(G) ∪{uv|d(u,v) =k} for natural number k. In this paper,it is proved that P_n^3 is a graceful graph.

Super-edge-graceful Labelings of Some Cubic Graphs

The notion of super-edge-graceful graphs was introduced by Mitchem and Simoson in 1994.However, few examples except trees are known. In this paper, we exhibit two classes of infinitely many cubic graphs which are super-edge-graceful. A conjecture is proposed.

Gracefulness of Two Kinds of Unconnected Graphs with Even Vertices

Two kinds of unconnected double fan graphs with even vertices,(P^((1))_(1)∨(P^((1))_(2n)∪P^((2))_(2n)))∪P_(2n+1)∪(P_(1)^((2))∨K_(2n))and(P_(1)^((1))∨(P^((1))_(2n)∪P^((2))_(2n)))∪(P_(1)^((2))∨K_((1))^(2n))∪(P^((3))_(1)∨K_((2))^(2n))were presented.For natural number n∈N,n≥1,the two graphs are all graceful graphs,where P^((1))_(2n),P^((2))_(2n)are even-vertices path,P_(2n+1)is odd-vertices path,K_(2n),K^((1))_(2n),K^((2))_(2n)are the complement of graph K_(2 n),G_(1)∨G_(2)is the join graph of G_(1)and G_(2).

Gracefulness of Several Unconnected Graphs with Wheel

In the paper, we study the gracefulness of several unconnected graphs related to wheel. For natural number p ≥ 1, t ≥ 1 , let n = 2t ＋ 3,2t ＋ 4 , which proved W. U K （1） p,t U K（2） is graceful; for p≥1, t≥1 ,let n=2t＋3,2t＋4, then Wn,2n＋1 U K（1）p,t U K（2） p,t is graceful and for m ≥ 1, r ≥ 1 , let n = 2m ＋ 5, Wn,2n＋1 U （C3 v Km） U St（r） is graceful.

On the Gracefulness of the Digraphs n·Cm＊

A digraph D（V, E） is said to be graceful if there exists an injection f ： V（G） →{0, 1,... , ｜E｜} such that the induced function f＇ ： E（G） --~ {1, 2,… , ｜E｜} which is defined by f＇ （u, v） = [f（v） - f（u）] （rood ｜E｜＋ 1） for every directed edge （u, v） is a bijection. Here, f is called a graceful labeling （graceful numbering） of D（V, E）, while f＇ is called the induced edge＇s graceful labeling of D. In this paper we discuss the gracefulness of the digraph n- Cm and prove that n. Cm is a graceful digraph for m = 15, 17 and even

基于最省刻度尺构造极小优美图的图论方法

[目的]利用最省刻度尺的已有研究成果研究极小优美图的构造方法.[方法]对任意正整数n≥2,在长度是n的无刻度直尺上最少刻多少个刻度,就能度量1-n的所有长度,这就是最省刻度的尺子问题.给定正整数n,存在m个整数组成的集合{a_(i)},满足0=a_(1)<a_(2)<…<a_(m)=n,使得任意整数s(0≤s≤n)均可表示成该集合中两个元素的差a_(j)-a_(i),则称{a_(i)}为n上的受限差基.根据极小优美图和受限差基的定义,将极小优美图问题等效为最省刻度尺问题进而得到极小优美图的构造方法.[结果]由n≥5时K n不是优美图和n≥1时图K 4+K n,n是优美图的结论,得到了边数是6至82的极小优美图顶点数的上下界;用构造方法给出了图K_(3)∨K 1,3,n-3 e,K_(3,n)∨K_(3-e)和K_(2,3,n)∨K_(3)-7e的优美标号,从而证明了这三类图都是优美图,并且当0≤n≤9时,K_(3)∨K_(1,3,,n)-3 e和K_(2,3,n)∨K_(3)-7e都是极小优美图,当0≤n≤8时,K_(3,n)∨K_(3-e)都是极小优美图,由此给出了29组最省刻度尺的刻度值.[结论]最省刻度尺可以为构造极小优美图提供新的研究思路.

最省刻度尺设计的组合差集递推算法

在长度为n(n≥2为正整数)的直尺上最少刻多少个刻度就能度量1到n的所有长度,这便是至今未解决的最省刻度尺问题。阐明了最省刻度尺与极小优美图之间的关系,给出了计算最省刻度尺的所有最省刻度值的组合差集递推算法,得到长度为3~40的最省刻度尺的所有最省刻度值,同时,结合图论模型,给出了长度为41~82的最省刻度尺的最省刻度值。

A Note on General Third Geometric-arithmetic Index of Special Chemical Molecular Structures

In theoretical chemistry, the geometric-arithmetic indices were introduced to measure the stability of alkanes and the strain energy of cycloalkanes. In this note, we report the general third geometric-arithmetic index of unilateral polyomino chain and unilateral hexagonal chain. Also, the third geometric-arithmetic index of these chemical structures are presented.

5类图的优美性

用构造方法给出图K_(2,n)-1-3-K_(3),K_(2,n)-2-2-K_(3),K_(2,n)-1-2-K_(3),K_(2,n)-2-K_(3)和K_(2,n)-3-P_(3)的优美标号,并证明这五类图都是优美图.当n≤5时,K_(2,n)-1-3-K_(3),K_(2,n)-2-2-K_(3),K_(2,n)-1-2-K_(3)和K_(2,n)-3-P_(3)都是极小优美图,并给出对应长度尺子刻度数最少的15组刻度值.

神经网络化简非多项式混合布尔算术表达式

混合布尔算术表达式是指混合使用了位运算符和算术运算符的表达式,其是一种先进的软件混淆技术.现有的反混淆方法虽然能够化简特定类型的混合布尔算术表达式,但是对非多项式混合布尔算术表达式仅有有限的化简效果.本文提出一种字符串到字符串的解决方案NeuSim,它通过神经网络来学习和化解非多项式混合布尔算术表达式.首先,本文分别构建基于序列到序列架构和图序列架构的神经网络模型.其次,本文生成一个大规模的非多项式混合布尔算术表达式数据集,它包含一百万个形式多样的表达式样本.在数据集上训练之后,NeuSim可以将一个非多项式混合布尔算术表达式化简为等价的简单表达式.实验结果表明,NeuSim的化简正确率是已有方法的8倍,并且其化简时间低于0.01秒.

基于双圈图GA_(2)指标的分析

设G是一个具有n个顶点的简单图,则图G的GA_(2)指标定义为:∑2√n_(u)n_(v)/(n_(u)+n_(v)),其中n(u)(n(v))表示图G中的点到顶点u(v)的距离小于到顶点v(u)的距离的点数.在本文中,对3类双圈图进行图形的变换,进而分析确定了具有最小GA_(2)指标的图.

融合哈密顿图的麻雀与算术混合优化算法

针对麻雀搜索算法(SSA)迭代后期种群多样性减少、易陷入局部最优等问题,提出一种基于哈密顿图的麻雀算术混合优化算法(HSSAAOAH)。首先,在SSA发现者-跟随者模型和侦察机制的基础上,引入算术优化算法(AOA)的乘除算子。利用乘除算子的高分布性,提高算法在迭代后期解的多样性;其次,将种群中所有个体转化成一个无向加权图,在每一轮迭代后,使用改良圈算法计算个体构成的哈密顿环长度,根据相邻两代长度的比值衡量种群收敛趋势;然后,对于没能有效收敛的子代,随机生成一定数量的个体并使用贪婪策略进行选择,替代表现较差的个体,提高解的质量,增强跳出局部极值的能力;最后,将HSSAAOAH与不同优化算法在基准函数和两个工程设计问题上进行仿真实验,结果表明HSSAAOAH算法收敛速度更快,寻优精度更高,具有良好的鲁棒性和寻优性能。

龙图的优美性

根据复杂网络研究的需要,定义(k,m)-龙图和一致(k,m)-龙图作为复杂网络的模型.并且主要对(k,m)-龙图的优美性进行研究,其中证明方法可算法化.

两类非连通图(P_2∨)∪St(m)及(P_2∨)∪T_n的优美性

对自然数n,m,i∈N,设Ki表示i个顶点的完全图,Kn是Kn的补图,St(m)表示m+1个顶点的星形树,Tn为n个节点的优美树,Pn为n个节点的路,P2∨Kn是P2与Kn联图.给出非连通图(P2∨Kn)∪St(m)和(P2∨Kn)∪Tn,并论证了当n≥2时,这两类图都是优美图.

和轮相关图的优美性

证明了对任意自然数n≥1,p≥1,当m=2p+3,2p+4时,非连通图Wm∪Kn,p和Wm,2m+1∪Kn,p是优美图;当i=1,2时,图W2p+2+i∪G(p i)是优美图。当m≥3,n≥s时,Wm,2m+1∪St(n)是优美图;当m=2n+5时,图Wm,2m+1∪(C3∨Kn)是优美图。

非连通图(P_3∨■)∪G及(C_3∨■)∪G的优美性

将k-优美图的概念进行了推广,引入A～B优美图的概念,并以此为基础,得到了非连通图(P3∨■)∪G及(C3∨■)∪G是优美图的一个充分条件。证明了对任意正整数k,m,n,t,当k≤n≤t,n+k-1≤m时,图(P3∨■)∪(∪kj=1Kn,t)和(C3∨■)∪(∪kj=1Kn,t)是优美图;当k=1,2,2≤n<2m+1时,图(P3∨■)∪∪kj=1P(j)n,(C3∨■)∪∪kj=1P(j)n和(P3∨■)∪Pn∪St(t)是优美图;当2≤n≤2m+1时,(C3∨■)∪Pn∪St(t)是优美图。本文的结果推广了现有的一些结论。