检索结果-南通市图书馆

Embedding Generalized Petersen Graph in Books

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Chinese Annals of Mathematics,Series B 2016年第3期37卷 385-394页

作者： Bin ZHAO Wei XIONG Yingzhi TIAN jixiang meng College of Mathematics and System Science Xinjiang University

A book embedding of a graph G consists of placing the vertices of G on a spine and assigning edges of the graph to pages so that edges in the same page do not cross each other. The page number is a measure of the quality of a book embedding which is the minimum number of pages in which the graph G can be embedded. In this paper, the authors discuss the embedding of the generalized Petersen graph and determine that the page number of the generalized Petersen graph is three in some situations, which is best possible.

关键词：彼得森图广义嵌入最小数面数顶点相交

Some Upper Bounds Related with Domination Number

在线全文

学校读者我要写书评

暂无评论

Journal of the Operations Research Society of China 2013年第2期1卷 217-225页

作者： Zhao Gu jixiang meng Zhao Zhang Jin E.Wan College of Mathematics and System Sciences Xin Jiang UniversityUrumqi 830046China College of Information Science and Engineering Xin Jiang UniversityUrumqi 830046China

For a simple and connected graph G,denote the domination number,the diameter,and the radius of G asβ(G),D(G),and r(G),respectively.In this paper,we solve two conjectures on the upper bounds ofβ(G)·D(G)andβ(G)+r(G),which are proposed by the computer system AutoGraphiX.Extremal trees which attain the upper bounds are also considered.

关键词： AutoGraphiX Upper bounds Extremal tree Domination number

具有n-4个悬挂点的双圈补图的最小特征值的下界

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

新疆大学学报（自然科学版）（中英文） 2024年第1期41卷 20-26,36页

作者：周恋恋刘康孟吉翔新疆大学数学与系统科学学院新疆乌鲁木齐830017

图的最小特征值作为刻画图结构性质的参数具有重要的研究意义,且相比于谱半径,图的最小特征值研究较少.在补图简单无向且连通的情况下,通过运用相关知识分析,在有n-4个悬挂点的n阶双圈图集中刻画了最小邻接特征值的下界.

关键词：补图双圈图最小特征值下界

Super Cyclically Edge Connected Half Vertex Transitive Graphs

在线全文

学校读者我要写书评

暂无评论

Applied Mathematics 2013年第2期4卷 348-351页

作者： Haining Jiang jixiang meng Yingzhi Tian College of Mathematics and System Sciences Xinjiang University Urumqi China

Tian and meng in [Y. Tian and J. meng, λc -Optimally half vertex transitive graphs with regularity k, Information Processing Letters 109 (2009) 683 - 686] shown that a connected half vertex transitive graph with regularity k and girth g(G) ≥ 6 is cyclically optimal. In this paper, we show that a connected half vertex transitive graph G is super cyclically edge-connected if minimum degree δ(G) ≥ 6 and girth g(G) ≥ 6.

关键词： Cyclic Edge-Connectivity Cyclically Optimal Super Cyclically Edge-Connected Half Vertex Transitive Graph

Connectivities　of　Minimal　Cayley　Coset　Digraphs

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Applied Mathematics(A Journal of Chinese Universities) 1996年第4期11卷 497-500页

作者： meng jixiang Department of Mathematics Xinjiang University Urumqi

we prove that the Connectivities of Minimal Cayley Coset Digraphs are their regular degrees. Connectivity of transitive digraphs and a combinatorial propertyof finite groups Ann., Discrete Math., 8 1980 61--64 meng jixiang and Huang Qiongxiang On the connectivity of Cayley digraphs, to appear Sabidussi, G. Vertex transitive graphs Monatsh. Math., 68 1969 426--438 Watkins, M. E. Connectivity of transitive graphs J. Combin. Theory, 8 1970 23--29 Zemor, G. On positive and negative atoms of Cayley digraphs Discrete Applied Math., 23 1989 193--195 Department of Mathematics,Xinjiang University,Urumpi 830046.APPLIED MATHEMATICS 3. Statement of Inexact Method Here we assume F to be continuousely differentiable. Inexact Newton method was first studied in the solution of smooth equations (see ). Now, such a technique has been widely used in optimizations, nonlinear complementarity problems and nonsmooth equations (see, and , etc.) In order to establish the related inexact methods,we introduce a nonlinear operator T(x): R n  R n . Its components are defined as follows: (T(x)p) i=[HL(2:1,Z;2,Z] (x k+p k) i, if i∈(x k), H i(x k)+ min {(p k) i,F i(x k) Tp k}, if i∈(x k), F i(x k)+F i(x k) Tp k, i∈(x k).(3.1) Then, it is clear that the subproblem (2.5) turns to T(x k)p k=0.(3.2) In inexact algorithm, we determine p k in the followinginexact way ( see ). ‖T(x k)p k‖ υ k‖H(x k)‖,(3.3) where υ k is a given positive sequence. It is then obviously that (3.2),or equivalently (2.5), is a special case of (3.3) corresponding to υ k=0 . In particular, (3.3) can be used as a termination rule of the iterative process for solving (2.5). The following proposition shows the existence of λ k satisfying (2.4). Proposition 3.1. Let F be continuously differe ntiable. υ k is chosen so that υ k  for some constant ∈(0,1). Then p k generated by (3.3) is a descent direction of θ at x k, and for some const

关键词： Connectivity Cayley coset digraph

EMBEDDINGS OF ONE KIND OF GRAPHS

在线全文

学校读者我要写书评

暂无评论

Applied Mathematics(A Journal of Chinese Universities) 1997年第3期12卷 253-258页

作者： meng jixiang AND HUANG QIONGXIANG Department of Mathematics Northern Jiatong University Beijing

In this paper, Hamiltonian cycles and decompositions of Cayley digraphs are investigated. Sufficient conditions are given for these two problems respectively. Furthermore, the conditions are also necessary for 2 regular Cayley digraphs. In addition, some known results about the Cartesian products of two directed cycles are also deduced.

关键词： Surface embedding graph

在线全文

学校读者我要写书评

暂无评论

某加层改造项目混凝土框架柱加固设计案例

建筑结构 2023年第S2期53卷 1641-1646页

作者：蒋斌孟吉祥中船第九设计研究院工程有限公司上海200063

以某加层改造项目为例,介绍了项目加固改造的设计流程及结构方案。重点对混凝土框架柱的加固流程及方法进行了探讨。计算结果表明,所采用的加固措施切实可行。在加固方案的选择中,在确保设计计算过程无误的前提下,综合建筑特点、施工质... 详细信息

以某加层改造项目为例,介绍了项目加固改造的设计流程及结构方案。重点对混凝土框架柱的加固流程及方法进行了探讨。计算结果表明,所采用的加固措施切实可行。在加固方案的选择中,在确保设计计算过程无误的前提下,综合建筑特点、施工质量、施工难度、经济性、业主诉求等因素,最终选择符合加固项目特点的加固方案。实际工作中,加固设计往往由专业分包完成,主体设计单位需要有扎实的公式推导与计算基本功,对于专业加固公司提供的计算书应进行严格把控,因为最终盖章签字还是主体单位完成,责任主体还是主体设计单位。目前加固行业施工水平尚有一定地域、队伍差异,望设计人员能引起重视,在设计环节做到质量闭环。本文将为同类项目提供参考依据。

关键词：加层改造柱加固外包型钢加固法增大截面加固法

Almost all Cayley Graphs Are Hamiltonian

在线全文

学校读者我要写书评

暂无评论

Acta Mathematica Sinica,English Series 1996年第2期12卷 151-155页

作者： meng jixiang Huang Qiongxiang meng jixiang Huang Qiongxiang Department of Mathematics and Institute of Mathematics and Phisics Xinjiang University Urumqi,830046 China 新疆大学数学系新疆乌鲁木齐

It has been conjectured that there is a hamiltonian cycle in every finite connected Cayley graph.In spite of the difficulty in proving this conjecture,we show that almost all Cayley graphs are hamiltonian.That is,as the order n of a group G approaches infinity,the ratio of the number of hamiltonian Cayley graphs of G to the total number of Cayley graphs of G approaches 1.

关键词： Cay|ey graph Hamiltonian Random

在线全文

学校读者我要写书评

暂无评论

崇明东滩科研中心超限结构分析与设计

建筑结构 2023年第S2期53卷 171-177页

作者：蒋斌刘鹏孟吉祥中船第九设计研究院工程有限公司上海200063

崇明东滩科研中心为超限结构,同时存在平面不规则、多塔、吊挂转换等不规则项。采用YJK、Etabs进行了反应谱法对比分析、时程分析等,校核了反映谱法的计算结果;采用MIDAS/Gen进行了楼板应力分析,校核楼板小震弹性性能,为楼板中震不屈服... 详细信息

崇明东滩科研中心为超限结构,同时存在平面不规则、多塔、吊挂转换等不规则项。采用YJK、Etabs进行了反应谱法对比分析、时程分析等,校核了反映谱法的计算结果;采用MIDAS/Gen进行了楼板应力分析,校核楼板小震弹性性能,为楼板中震不屈服性能目标提供配筋依据。同时,介绍了吊挂结构方案比选过程,对比分析了梁上立柱转换与梁下吊挂转换两个方案。综合建筑功能等因素选择了梁下吊挂转换方案。应用包络设计理念对关键构件进行设计确保项目安全度。此外,采用MIDAS/Gen对吊挂区域楼面进行了舒适度分析,结果表明通过适当加强措施,楼面舒适度控制效果良好。本文可为同类结构的综合分析与设计提供参考。

关键词：超限结构反应谱法弹性时程楼板应力分析吊挂结构舒适度分析