DNA barcoding and molecular phylogeny of Dumasia(Fabaceae:Phaseoleae)reveals a cryptic lineage

Dumasia taxonomy and classification have long been problematic.Species within this genus have few morphological differences and plants without flowers or fruits are difficult to accurately identify.In this study,we evaluated the ability of six DNA barcoding sequences,one nuclear(ITS)and five chloroplast regions(trnH-psbA,matK,rbcL,trnL-trnF,psbB-psbF),to efficiently identify Dumasia species.Most single markers or their combinations identify obvious barcoding gaps between intraspecific and interspecific genetic variation.Most combined analyses including ITS showed good species resolution and identification efficiency.We therefore suggest that ITS alone or a combination of ITS with any cpDNA marker are most suitable for DNA barcoding of Dumasia.The phylogenetic analyses clearly indicated that Dumasia yunnanensis is not monophyletic and is separated as two independent branches,which may result from cryptic differentiation.Our results demonstrate that molecular data can deepen the comprehension of taxonomy of Dumasia and provide an efficient approach for identification of the species.

Correlation study between peripheral blood CD4+CD25+Treg levels and systemic inflammatory response in patients with sepsis

Objective:To study the correlation between peripheral blood CD4+CD25+Treg levels and systemic inflammatory response in patients with sepsis.Methods: 36 children who were diagnosed with sepsis in Children's Hospital of Hebei Province between June 2014 and December 2016 were selected as sepsis group, and healthy volunteer children who received physical examination during the same period were selected as control group. Peripheral blood was collected to determine the content of CD4+CD25+Treg cells, and the serum was collected to determine the contents of the inflammatory mediators and oxidative stress products.Results:Peripheral blood CD4+CD25+Treg cell level in sepsis group was significantly higher than that in control group. Serum ICAM-1, TNF-α, IL-1β, CRP, PCT, LPO, MDA and AOPPs levels in sepsis group were significantly higher those in control group;serum ICAM-1, TNF-α, IL-1β, CRP, PCT, LPO, MDA and AOPPs levels in sepsis children with high Treg level were significantly higher than those in sepsis children with low Treg level.Conclusion: Increased levels of CD4+CD25+Treg cells in patients with sepsis can activate systemic inflammatory response and oxidative stress response.

A Note on Adjacent Strong Edge Coloring of K(n,m)

In this paper, we prove that the adjacent strong edge chromatic number of a graph K（n,m） is n ＋ 1, with n ≥ 2, m ≥ 1.

Some Results on Spanning Trees

Some structures of spanning trees with many or less leaves in a connected graph are determined.We show（1） a connected graph G has a spanning tree T with minimum leaves such that T contains a longest path,and（2） a connected graph G on n vertices contains a spanning tree T with the maximum leaves such that Δ（G） =Δ（T） and the number of leaves of T is not greater than n D（G）＋1,where D（G） is the diameter of G.

Equitable Total Coloring of F_n ∨ W_n

The minimum number of total independent partition sets of V ∪ E of graph G（V,E） is called the total chromatic number of G denoted by χt（G）. If the difference of the numbers of any two total independent partition sets of V ∪ E is no more than one＇, then the minimum number of total independent partition sets of V ∪ E is called the equitable total chromatic number of G, denoted by χet（G）. In this paper, we obtain the equitable total chromatic number of the join graph of fan and wheel with the same order.

AVDTC Numbers of Generalized Halin Graphs with Maximum Degree at Least 6

In a paper by Zhang and Chen et al.（see [11]）, a conjecture was made concerning the minimum number of colors Xat（G） required in a proper total-coloring of G so that any two adjacent vertices have different color sets, where the color set of a vertex v is the set composed of the color of v and the colors incident to v. We find the exact values of Xat（G） and thus verify the conjecture when G is a Generalized Halin graph with maximum degree at least 6, A generalized Halin graph is a 2-connected plane graph G such that removing all the edges of the boundary of the exterior face of G （the degrees of the vertices in the boundary of exterior face of G are all three） gives a tree.

On the Relations of Graph Parameters and Its Total Parameters

In this paper we get some relations between α（G）, α＇（G）, β（G）, β＇（G） and αT（G）, βT（G）. And all bounds in these relations are best possible, where α（G）, α＇（G）,/3（G）, β（G）, αT（G） and βT（G） are the covering number, edge-covering number, independent number, edge-independent number （or matching number）, total covering number and total independent number, respectively.

On Defected Colourings of Graphs

Abstract A k-edge-coloring f of a connected graph G is a （A1, A2, , A）-defected k-edge-coloring if there is a smallest integer/ with 1 _ /3 _〈 k - i such that the multiplicity of each color j E {1,2,... ,/3} appearing at a vertex is equal to Aj _〉 2, and each color of {/3 -}- 1,/3 - 2, - , k} appears at some vertices at most one time. The （A1, A2,, A/）-defected chromatic index of G, denoted as X （A1, A2,, A/; G）, is the smallest number such that every （A1,A2,-.., A/）-defected t-edge-coloring of G holds t _〉 X（A1, A2 A;; G）. We obtain A（G） X（A1, ）2, , A/; G） ＋ -- （Ai - 1） _〈 /k（G） 1, and introduce two new chromatic indices of G i=1 as： the vertex pan-biuniform chromatic index X pb （G）, and the neighbour vertex pan-biuniform chromatic index Xnpb（G）, and furthermore find the structure of a tree T having X pb （T） =1.