广义Gr(o)tzsch环函数的近似凹凸性

In this paper, the so-called approximate convexity and concavity properties of generalized Groetzsch ring function μa （r） by studying the monotonieity,convexity or concavity of certain composites of μa（r） are obtained.     

关于图的同构判定方法的探讨

对于两图的同构的判定方法进行较深入的探讨,给出判定两图同构和判定两图不同构的几种方法,并对其判定方法的优劣进行比较.     

关于两个图的一类新连接图的谱

给定2个图G1和G2,设G1的边集E(G1)={e1,e2,?,em1},则图G1⊙G2可由一个G1,m1个G2通过在G1对应的每条边外加一个孤立点,新增加的点记为U={u1,u2,?,um1},将ui分别与第i个G2的所有点以及G1中的边ei的端点相连得到,其中i=?1,2,?,m1。得到：（i）当G1是正则图,G2是正则图或完全二部图时,确定了G1⊙G2的邻接谱（A-谱）。（ii）当G1是正则图,G2是任意图时,给出了G1⊙G2的拉普拉斯谱（L-谱）。（iii）当G1和G2都是正则图时,给出了G1⊙G2的无符号拉普拉斯谱（Q-谱）。作为以上结论的应用,构建了无限多对A-同谱图、L-同谱图和Q-同谱图;同时当G1是正则图时,确定了G1⊙G2支撑树的数量和Kirchhoff指数。     

基于能力培养的应用型本科物理实验教学模式探索

通过对传统大学物理实验教学现状的分析和讨论,针对目前大学物理实验课程的教学模式进行研究,在遵循实验教学自身规律的前提下,构建“模块化”实验课程教学模式,从而改善课程结构,为培养学生解决具体问题的实践能力和创新思维提供针对性的训练;并采用“启发式”“问题式”的教学方法和多样化的考核评价标准,对于不同专业、不同基础、不同背景的学生进行差异化教学,建立以人才培养为核心的科学教学体系,进一步提高大学物理实验课程的教学质量和效果.     

An Improved Plotting Package Applied to Chemical Graphing Problems

Abstract

A plotting package, written in LINC assembly language, is described. It produces high quality graphs and labels the graphs for direct submission to professional journals. A μ-LINC (Laboratory INstrument (Computer) is used to compute least-squares fitted curves and lines from data entered either on-or off-line and to draw the graphs directly on an incremental plotter. Bar graphs, line graphs, and fitted data can be plotted with options to suppress the lines and/or the points.     

Perpetual cutoff method and CDE′(K,N) condition on graphs

By using the perpetual cutoff method, we prove two discrete versions of gradient estimates for bounded Laplacian on locally finite graphs with exception sets under the condition of CD{E}^{\prime }(K,N). This generalizes a main result of F. Münch who considers the case of CD(K, \infty) curvature. Hence, we answer a question raised by Münch. For that purpose, we characterize some basic properties of radical form of the perpetual cutoff semigroup and give a weak commutation relation between bounded Laplacian \text{Δ} and perpetual cutoff semigroup P_t^W in our setting.     

A survey on book-embedding of planar graphs

The book-embedding problem arises in several area, such as very large scale integration (VLSI) design and routing multilayer printed circuit boards (PCBs). It can be used into various practical application fields. A book embedding of a graph G is an embedding of its vertices along the spine of a book, and an embedding of its edges to the pages such that edges embedded on the same page do not intersect. The minimum number of pages in which a graph G can be embedded is called the pagenumber or book-thickness of the graph G. It is an important measure of the quality for book-embedding. It is NP-hard to research the pagenumber of book-embedding for a graph G. This paper summarizes the studies on the book-embedding of planar graphs in recent years.     

Comment on “Kirchhoff index in line,subdivision and total graphs of a regular graph”

Let G$G$ be a connected regular graph. Denoted by t(G)$t\left(G\right)$ and Kf(G)$Kf\left(G\right)$ the total graph and Kirchhoff index of G$G$, respectively. This paper is to point out that Theorem 3.7 and Corollary 3.8 from “Kirchhoff index in line, subdivision and total graphs of a regular graph” [X. Gao, Y.F. Luo, W.W. Liu, Kirchhoff index in line, subdivision and total graphs of a regular graph, Discrete Appl. Math. 160(2012) 560–565] are incorrect, since the conclusion of a lemma is essentially wrong. Moreover, we first show the Laplacian characteristic polynomial of t(G)$t\left(G\right)$, where G$G$ is a regular graph. Consequently, by using Kf(G)$Kf\left(G\right)$, we give an expression on Kf(t(G))$Kf\left(t\left(G\right)\right)$ and a lower bound on Kf(t(G))$Kf\left(t\left(G\right)\right)$ of a regular graph G$G$, which correct Theorem 3.7 and Corollary 3.8 in Gao et al. (2012)  [2].     

Convergent sequences of sparse graphs: A large deviations approach

Models based on sparse graphs are of interest to many communities: they appear as basic models in combinatorics, probability theory, optimization, statistical physics, information theory, and more applied fields of social sciences and economics. Different notions of similarity (and hence convergence) of sparse graphs are of interest in different communities. In probability theory and combinatorics, the notion of Benjamini‐Schramm convergence, also known as left‐convergence, is used quite frequently. Statistical physicists are interested in the the existence of the thermodynamic limit of free energies, which leads naturally to the notion of right‐convergence. Combinatorial optimization problems naturally lead to so‐called partition convergence, which relates to the convergence of optimal values of a variety of constraint satisfaction problems. The relationship between these different notions of similarity and convergence is, however, poorly understood. In this paper we introduce a new notion of convergence of sparse graphs, which we call Large Deviations or LD‐convergence, and which is based on the theory of large deviations. The notion is introduced by “decorating” the nodes of the graph with random uniform i.i.d. weights and constructing corresponding random measures on and . A graph sequence is defined to be converging if the corresponding sequence of random measures satisfies the Large Deviations Principle with respect to the topology of weak convergence on bounded measures on . The corresponding large deviations rate function can be interpreted as the limit object of the sparse graph sequence. In particular, we can express the limiting free energies in terms of this limit object. We then establish that LD‐convergence implies the other three notions of convergence discussed above, and at the same time establish several previously unknown relationships between the other notions of convergence. In particular, we show that partition‐convergence does not imply left‐ or right‐convergence, and that right‐convergence does not imply partition‐convergence. © 2016 Wiley Periodicals, Inc. Random Struct. Alg., 51, 52–89, 2017     

Ramanujan-Göllnitz-Gordon Continued Fraction

We derive many new identities involving the Ramanujan-Göllnitz-Gordon continued fraction H(q). These include relations between H(q) and H(q ⁿ ) , which are established using modular equations of degree n. We also evaluate explicitly H(q) at for various positive integers n. Using results of M. Deuring, we show that are units for all positive integers n.