Maximizing the mean subtree order

This article focuses on properties and structures of trees with maximum mean subtree order in a given family; such trees are called optimal in the family. Our main goal is to describe the structure of optimal trees in and , the families of all trees and caterpillars, respectively, of order . We begin by establishing a powerful tool called the Gluing Lemma, which is used to prove several of our main results. In particular, we show that if is an optimal tree in or for , then every leaf of is adjacent to a vertex of degree at least . We also use the Gluing Lemma to answer an open question of Jamison and to provide a conceptually simple proof of Jamison's result that the path has minimum mean subtree order among all trees of order . We prove that if is optimal in , then the number of leaves in is and that if is optimal in , then the number of leaves in is . Along the way, we describe the asymptotic structure of optimal trees in several narrower families of trees.     

蛹虫草超氧化物歧化酶理化性质的研究

超氧化物歧化酶[Superoxide d ismutase,SOD,(EC.1.15.1.1)]是广泛存在于生物体内的超氧阴离子自由基(·O2-)的天然清除剂,在机体保护方面起重要作用。在对SOD进行的一系列研究中,发现SOD的存在与生物体抗衰老、抗肿瘤、营养状况、免疫性疾病、炎症及辐射防护[1]有关。许多动植     

冬虫夏草中8种矿物元素含量分析

利用火焰原子吸收光谱法(FAAS),测定了冬虫夏草中Cu,Zn,Fe,Mn,Mg,Ca,Co以及Cd等8种矿物元素的含量,测定了各元素的加标回收率在98.9%~109.3%之间,相对标准偏差(RSD)小于1.2%,具有良好的准确度和精确度。结果表明,冬虫夏草中含有丰富的Cu,Zn,Fe,Mn,Mg,Ca,Co等多种矿物元素,不含有毒金属元素Cd。     

用连续型分布拟合马尾松毛虫种群空间分布型

本文用连续型分布拟合马尾松毛虫越冬代幼虫的空间分布型。结果表明，在高虫口密度情况下，幼虫服从Ｗｅｉｂｕｌｌ分布或指数分布。     

Degree sum and vertex dominating paths

A vertex dominating path in a graph is a path P such that every vertex outside P has a neighbor on P. In 1988 H. Broersma [5] stated a result implying that every n‐vertex k‐connected graph G such that contains a vertex dominating path. We provide a short, self‐contained proof of this result and further show that every n‐vertex k‐connected graph such that contains a vertex dominating path of length at most , where T is a minimum dominating set of vertices. An immediate corollary of this result is that every such graph contains a vertex dominating path with length bounded above by a logarithmic function of the order of the graph. To derive this result, we prove that every n‐vertex k‐connected graph with contains a path of length at most , through any set of T vertices where .     

毛毛虫树的最优$L(2,1,1)$-标号

图$G$的一个$L(2,1,1)$-标号是指从顶点集$V(G)$到非负整数集上的一个函数$f$,满足: 当$d(u,v)=1$时, $|f(u)-f(v)|\ge 2$, 当$d(u,v)=2$时, $|f(u)-f(v)|\ge 1$, 当$d(u,v)=3$时, $|f(u)-f(v)|\ge 1$. 若一个$L(2,1,1)$-标号中的所有像元素都不超过整数$k$, 则称之为图$G$的$k$-$L(2,1,1)$-标号. 图$G$的$L(2,1,1)$-标号数, 记作$\lambda 2,1,1(G)$,是使得图$G$存在$L(2,1,1)$-标号的最小整数$k$. 本文研究了毛毛虫树的最优$L(2,1,1)$-标号,给出了一些$L(2,1,1)$-标号数达到上界的充分条件,并完全刻画了最大边度为6的毛毛虫树的$L(2,1,1)$-标号数.     

Edge Partition of Graphs Embeddable in the Projective Plane and the Klein Bottle

In a previous paper by the author joint with Baogang XU published in Discrete Math in 2018, we show that every non-planar toroidal graph can be edge partitioned into a planar graph and an outerplanar graph. This edge partition then implies some results in thickness and outerthickness of toroidal graphs. In particular, if each planar graph has outerthickness at most $2$ (conjectured by Chartrand, Geller and Hedetniemi in 1971 and the confirmation of the conjecture was announced by Gon\c{c}alves in 2005), then the outerthickness of toroidal graphs is at most 3 which is the best possible due to $K_7$. In this paper we continue to study the edge partition for projective planar graphs and Klein bottle embeddable graphs. We show that (1) every non-planar but projective planar graph can be edge partitioned into a planar graph and a union of caterpillar trees; and (2) every non-planar Klein bottle embeddable graph can be edge partitioned into a planar graph and a subgraph of two vertex amalgamation of a caterpillar tree with a cycle with pendant edges. As consequences, the thinkness of projective planar graphs and Klein bottle embeddabe graphs are at most $2$, which are the best possible, and the outerthickness of these graphs are at most $3$.     

Balanced caterpillars of maximum degree 3 and with hairs of arbitrary length are subgraphs of their optimal hypercube

A caterpillar is a tree having a path that contains all vertices of of degree at least 3. We show in this article that every balanced caterpillar with maximum degree 3 and 2ⁿ vertices is a subgraph of the n‐dimensional hypercube. This solves a long‐standing open problem and generalizes a result of Havel and Liebl (1986), who considered only such caterpillars that have a path containing all vertices of degree at least 2.     

Extremal Wiener and Kirchhoff indices of globular caterpillars

The Wiener and Kirchhoff indices of a graph G are two of the most important topological indices in mathematical chemistry. A graph G is called to be a globular caterpillar if G is obtained from a complete graph K _s with vertex set {v₁,v₂,…, v _s} by attaching n _i pendent edges to each vertex v _i of K _s for some positive integers s and n₁,n₂,…,n _s, denoted by . Let be the set of globular caterpillars with n vertices (). In this article, we characterize the globular caterpillars with the minimal and maximal Wiener and Kirchhoff indices among , respectively.     

A better bound for the cop number of general graphs

In this note, we prove that the cop number of any n‐vertex graph G, denoted by , is at most . Meyniel conjectured . It appears that the best previously known sublinear upper‐bound is due to Frankl, who proved . © 2008 Wiley Periodicals, Inc. J Graph Theory 58: 45–48, 2008