A linear forest is a forest whose components are paths. The linear arboricity la （G） of a graph G is the minimum number of linear forests which partition the edge set E（G） of G. The Cartesian product G□H of two g...A linear forest is a forest whose components are paths. The linear arboricity la （G） of a graph G is the minimum number of linear forests which partition the edge set E（G） of G. The Cartesian product G□H of two graphs G and H is defined as the graph with vertex set V（G□H） = {（u, v）｜ u ∈V（G）, v∈V（H） } and edge set E（G□H） = { （ u, x） （ v, Y）｜u=v and xy∈E（H）, or uv∈E（G） and x=y}. Let Pm and Cm,, respectively, denote the path and cycle on m vertices and K, denote the complete graph on n vertices. It is proved that （Km□Pm）=[n＋1/2]for m≥2,la（Km□Cm）=[n＋2/2],and la（Km□Km）=[n＋m-1/2]. The methods to decompose these graphs into linear forests are given in the proofs. Furthermore, the linear arboricity conjecture is true for these classes of graphs.展开更多
A star forest is a forest whose components are stars. The star arboricity of a graph G,denoted by sa（ G）,is the minimum number of star forests needed to decompose G. Let k be a positive integer. A k-star forest is a...A star forest is a forest whose components are stars. The star arboricity of a graph G,denoted by sa（ G）,is the minimum number of star forests needed to decompose G. Let k be a positive integer. A k-star forest is a forest whose components are stars of order at most k ＋ 1. The k-star arboricity of a graph G,denoted by sak（ G）,is the minimum number of k-star forests needed to decompose G. In this paper,it is proved that if any two vertices of degree 3 are nonadjacent in a subcubic graph G then sa2（ G） ≤2.For general subcubic graphs G, a polynomial-time algorithm is described to decompose G into three 2-star forests. For a tree T and[Δ k, T）/k]t≤ sak（ T） ≤[Δ（ T）- 1/K]＋1,where Δ（ T） is the maximum degree of T.kMoreover,a linear-time algorithm is designed to determine whether sak（ T） ≤m for any tree T and any positive integers m and k.展开更多
A graph is NIC-planar if it admits a drawing in the plane with at most one crossing per edge and such that two pairs of crossing edges share at most one common end vertex. It is proved that every NIC-planar graph with...A graph is NIC-planar if it admits a drawing in the plane with at most one crossing per edge and such that two pairs of crossing edges share at most one common end vertex. It is proved that every NIC-planar graph with minimum degree at least 2(resp. 3) contains either an edge with degree sum at most 23(resp. 17) or a 2-alternating cycle(resp. 3-alternating quadrilateral). By applying those structural theorems, we confirm the Linear Arboricity Conjecture for NIC-planar graphs with maximum degree at least 14 and determine the linear arboricity of NIC-planar graphs with maximum degree at least 21.展开更多
The arboricity of graph G=(V,E), denoted by a(G), is defined as a(G)=min{n | E can be partitioned into n subsets E1,E2,...,En, such that each subset spans a subgraph of G so as to be a forest}.In this paper the follow...The arboricity of graph G=(V,E), denoted by a(G), is defined as a(G)=min{n | E can be partitioned into n subsets E1,E2,...,En, such that each subset spans a subgraph of G so as to be a forest}.In this paper the following results have been obtained. For any graph G of order p,and the bounds are sharp; especially as an integer function, 5p+7 could not be decreased. Furthermore, Nordhaus-Gaddum Theorem for arboricity has also been got.展开更多
A graph is outer-1-planar if it can be drawn in the plane so that all vertices are on the outer face and each edge is crossed at most once.Zhang et al.(Edge covering pseudo-outerplanar graphs with forests,Discrete Mat...A graph is outer-1-planar if it can be drawn in the plane so that all vertices are on the outer face and each edge is crossed at most once.Zhang et al.(Edge covering pseudo-outerplanar graphs with forests,Discrete Math 312:2788-2799,2012;MR2945171)proved that the linear arboricity of every outer-1-planar graph with maximum degree△is exactly[△/2] provided that△=3or△≥5 and claimed that there are outer-1-planar graphs with maximum degree △=4 and linear arboricity[[(O+1)/2]=3.It is shown in this paper that the linear arboricity of every outer-1-planar graph with maximum degree 4 is exactly 2 provided that it admits an outer-1-planar drawing with crossing distance at least 1 and crossing width at least 2,and moreover,none of the above constraints on the crossing distance and Crossing width can be removed..Besides,a polynomial-time algorithm for constructing a path-2-coloring(i.e.,an edge 2-coloring such that each color class induces a linear forest,a disjoint union of paths)of such an outer-1-planar drawing is given.展开更多
The equitable tree-coloring can formulate a structure decomposition problem on the communication network with some security considerations.Namely,an equitable tree-Zc-coloring of a graph is a vertex coloring using k d...The equitable tree-coloring can formulate a structure decomposition problem on the communication network with some security considerations.Namely,an equitable tree-Zc-coloring of a graph is a vertex coloring using k distinct colors such that every color class induces a forest and the sizes of any two color classes differ by at most one.In this paper,we show some theoretical results on the equitable tree-coloring of graphs by proving that every d-degenerate graph with maximum degree at most Δ is equitably tree-fc-colorable for every integer k≥(Δ+1)/2 provided that Δ≥9.818d,confirming the equitable vertex arboricity conjecture for graphs with low degeneracy.展开更多
The linear arboricity la(G) of a graph G is the minimum number of linear forests which partition the edges of G. Akiyama, Exoo and Harary conjectured that la(G) = [△(G)+1/2] for any regular graph G. In this paper, we...The linear arboricity la(G) of a graph G is the minimum number of linear forests which partition the edges of G. Akiyama, Exoo and Harary conjectured that la(G) = [△(G)+1/2] for any regular graph G. In this paper, we prove the conjecture for some composition graphs, in particular, for complete multipartite graphs.展开更多
A linear directed forest is a directed graph in which every component is a directed path.The linear arboricity la(D) of a digraph D is the minimum number of linear directed forests in D whose union covers all arcs of ...A linear directed forest is a directed graph in which every component is a directed path.The linear arboricity la(D) of a digraph D is the minimum number of linear directed forests in D whose union covers all arcs of D. For every d-regular digraph D, Nakayama and P′eroche conjecture that la(D) = d + 1. In this paper, we consider the linear arboricity for complete symmetric digraphs,regular digraphs with high directed girth and random regular digraphs and we improve some wellknown results. Moreover, we propose a more precise conjecture about the linear arboricity for regular digraphs.展开更多
The nervous system function requires a precise but plastic neural architecture.The neuronal shape dictates how neurons interact with each other and with other cells,being the morphology of dendrites and axons the cent...The nervous system function requires a precise but plastic neural architecture.The neuronal shape dictates how neurons interact with each other and with other cells,being the morphology of dendrites and axons the central determinant of the functional properties of neurons and neural circuits.The topological and structural morphology of axons and dendrites defines and determines how synapses are conformed.The morphological diversity of axon and dendrite arborization governs the neuron’s inputs,synaptic integration,neuronal computation,signal transmission,and network circuitry,hence defining the particular connectivity and function of the different brain areas.展开更多
Since the first electron micrograph of“lace-like structures”over 75 years ago,the endoplasmic reticulum(ER)is now viewed as a highly dynamic,constantly remodeling,continuous network of tubules and cisternae that pla...Since the first electron micrograph of“lace-like structures”over 75 years ago,the endoplasmic reticulum(ER)is now viewed as a highly dynamic,constantly remodeling,continuous network of tubules and cisternae that plays an important role in a broad range of cellular activities from calcium regulation to protein synthesis and trafficking.In neurons,the ER extends from the soma through the axon to presynaptic terminals,and throughout the dendritic arbor into as many as half of all postsynaptic dendritic spines at any given time(Falahati et al.,2022).展开更多
目的探讨外周血miR-141、miR-451a与弥漫大B细胞淋巴瘤(diffuse large B-cell lymphoma,DLBCL)患者化疗应答的预测价值。方法选取2021年6月至2023年4月我院92例DLBCL患者作为DLBCL组,根据化疗效果分为化疗无效亚组(n=29)与化疗有效亚组(...目的探讨外周血miR-141、miR-451a与弥漫大B细胞淋巴瘤(diffuse large B-cell lymphoma,DLBCL)患者化疗应答的预测价值。方法选取2021年6月至2023年4月我院92例DLBCL患者作为DLBCL组,根据化疗效果分为化疗无效亚组(n=29)与化疗有效亚组(n=63)。随机选取同期92例入院体检健康者为对照组,采用实时荧光定量聚合酶链反应测定miR-141、miR-451a相对表达量。比较DLBCL组与健康对照组外周血miR-141、miR-451a表达,以logistic回归模型分析筛选DLBCL患者化疗应答影响因素,相关性分析DLBCL患者外周血miR-141、miR-451a与国际预后指数(international prognositic index,IPI)评分、Ann Arbor分期间相关性,受试者工作特征(receiver operating characteristic,ROC)曲线评价DLBCL患者miR-141、miR-451a单项检测及联合检测预测化疗应答的价值。结果DLBCL患者外周血miR-141、miR-451a表达均低于健康对照组(P<0.05);logistic回归分析结果显示Ann Arbor分期、IPI评分均为DLBCL患者化疗应答独立危险因素,外周血miR-141、miR-451a均为DLBCL患者化疗应答性独立保护因素(P<0.05);DLBCL患者外周血miR-141、miR-451a与IPI评分、Ann Arbor分期均具有显著负相关关系(P<0.05);外周血miR-141、miR-451a单独预测DLBCL患者化疗应答的曲线下面积(area under the curve,AUC)值分别为0.770、0.794,二者联合预测AUC值高达0.929,明显高于miR-141、miR-451a单独预测,此时灵敏度、特异度分别为86.21%、85.71%。结论DCBCL患者血清miR-141、miR-451a表达下调,且与应答有关,检测二者水平,可预测DCBCL患者化疗应答,为临床工作提供参考。展开更多
A graph G is called d-degenerate if every subgraph of G has a vertex of degree at most d.It was known that planar graphs are 5-degenerate and every planar graph without k-cycles for some prescribed k∈{3,5,6}is 3-dege...A graph G is called d-degenerate if every subgraph of G has a vertex of degree at most d.It was known that planar graphs are 5-degenerate and every planar graph without k-cycles for some prescribed k∈{3,5,6}is 3-degenerate.In this paper,we show that if G is a planar graph without kites and 9-or 10-cycles,then G is 3-degenerate,hence 4-choosable and list vertex 2-arborable.展开更多
Background Salmonella enterica serovar Enteritidis(S.Enteritidis)is a global foodborne pathogen that poses a significant threat to human health,with poultry being the primary reservoir host.Therefore,addressing S.Ente...Background Salmonella enterica serovar Enteritidis(S.Enteritidis)is a global foodborne pathogen that poses a significant threat to human health,with poultry being the primary reservoir host.Therefore,addressing S.Enteritidis infections in poultry is crucial to protect human health and the poultry industry.In this study,we investigated the effect of co-housing Arbor Acres(AA)chickens,a commercial breed susceptible to S.Enteritidis,with Tibetan chickens,a local breed resistant to S.Enteritidis infection,on the resistance of the latter to the pathogen.Results Ninety-six 1-day-old Tibetan chickens and 961-day-old AA chickens were divided into a Tibetan chicken housed alone group(n=48),an AA chicken housed alone group(n=48),and a co-housed group(48 birds from each breed for 2 cages).All birds were provided the same diet,and the experimental period lasted 14 d.At d 7,all chickens were infected with S.Enteritidis,and samples were collected at 1-,3-,and 7-day-post-infection.We found that the body weight of AA chickens significantly increased when co-housed with Tibetan chickens at 1-and 3-day-post-infection(P<0.05).In addition,the cecal S.Enteritidis load in AA chickens was significantly reduced at 1-,3-,and 7-day-post-infection(P<0.05).Furthermore,the inflammatory response in AA chickens decreased,as evidenced by the decreased expression of proinflammatory cytokines NOS2,TNF-α,IL-8,IL-1β,and IFN-γin their cecal tonsils(P<0.05).Co-housing with Tibetan chickens significantly increased the height of villi and number of goblet cells(P<0.05),as well as the expression of claudin-1(P<0.05),a tight junction protein,in the jejunum of AA chickens.Further analysis revealed that co-housing altered the gut microbiota composition in AA chickens;specifically,the relative abundances of harmful microbes,such as Intestinimonas,Oscillibacter,Tuzzerella,Anaerotruncus,Paludicola,and Anaerofilum were reduced(P<0.05).Conclusions Our findings indicate that co-housing with Tibetan chickens enhanced the resistance of AA chickens to S.Enteritidis infection without compromising the resistance of Tibetan chickens.This study provides a novel approach for Salmonella control in practical poultry production.展开更多
Pygmy lorises are arboreal primates primarily found in forest environments across Southeast Asia(Nekaris 2014).Theyhave a diverse diet,including plant secretions,nectar,fruits,invertebrates,tree bark,and bird eggs.All...Pygmy lorises are arboreal primates primarily found in forest environments across Southeast Asia(Nekaris 2014).Theyhave a diverse diet,including plant secretions,nectar,fruits,invertebrates,tree bark,and bird eggs.All 9 known speciesof pygmy lorises are listed as globally endangered species(Nekaris 2014).Pygmy lorises exhibit a range of unique phenotypic characteristics rarely seen among primates.展开更多
基金The National Natural Science Foundation of China(No.10971025)
文摘A linear forest is a forest whose components are paths. The linear arboricity la （G） of a graph G is the minimum number of linear forests which partition the edge set E（G） of G. The Cartesian product G□H of two graphs G and H is defined as the graph with vertex set V（G□H） = {（u, v）｜ u ∈V（G）, v∈V（H） } and edge set E（G□H） = { （ u, x） （ v, Y）｜u=v and xy∈E（H）, or uv∈E（G） and x=y}. Let Pm and Cm,, respectively, denote the path and cycle on m vertices and K, denote the complete graph on n vertices. It is proved that （Km□Pm）=[n＋1/2]for m≥2,la（Km□Cm）=[n＋2/2],and la（Km□Km）=[n＋m-1/2]. The methods to decompose these graphs into linear forests are given in the proofs. Furthermore, the linear arboricity conjecture is true for these classes of graphs.
基金National Natural Science Foundation of China(No.10971025)
文摘A star forest is a forest whose components are stars. The star arboricity of a graph G,denoted by sa（ G）,is the minimum number of star forests needed to decompose G. Let k be a positive integer. A k-star forest is a forest whose components are stars of order at most k ＋ 1. The k-star arboricity of a graph G,denoted by sak（ G）,is the minimum number of k-star forests needed to decompose G. In this paper,it is proved that if any two vertices of degree 3 are nonadjacent in a subcubic graph G then sa2（ G） ≤2.For general subcubic graphs G, a polynomial-time algorithm is described to decompose G into three 2-star forests. For a tree T and[Δ k, T）/k]t≤ sak（ T） ≤[Δ（ T）- 1/K]＋1,where Δ（ T） is the maximum degree of T.kMoreover,a linear-time algorithm is designed to determine whether sak（ T） ≤m for any tree T and any positive integers m and k.
基金Supported by the National Natural Science Foundation of China(Nos.11871055,11301410)the Natural Science Basic Research Plan in Shaanxi Province of China(No.2017JM1010)the Fundamental Research Funds for the Central Universities(Nos.JB170706)
文摘A graph is NIC-planar if it admits a drawing in the plane with at most one crossing per edge and such that two pairs of crossing edges share at most one common end vertex. It is proved that every NIC-planar graph with minimum degree at least 2(resp. 3) contains either an edge with degree sum at most 23(resp. 17) or a 2-alternating cycle(resp. 3-alternating quadrilateral). By applying those structural theorems, we confirm the Linear Arboricity Conjecture for NIC-planar graphs with maximum degree at least 14 and determine the linear arboricity of NIC-planar graphs with maximum degree at least 21.
文摘The arboricity of graph G=(V,E), denoted by a(G), is defined as a(G)=min{n | E can be partitioned into n subsets E1,E2,...,En, such that each subset spans a subgraph of G so as to be a forest}.In this paper the following results have been obtained. For any graph G of order p,and the bounds are sharp; especially as an integer function, 5p+7 could not be decreased. Furthermore, Nordhaus-Gaddum Theorem for arboricity has also been got.
基金supported by the Fundamental Research Funds for the Central Universities(No.JB170706)the Natural Science Basic Research Plan in Shaanxi Province of China(No.2017JM1010)+2 种基金the National Natural Science Foundation of China(Nos.11871055 and 11301410)supported by the Natural Science Basic Research Plan in Shaanxi Province of China(No.2017JQ1031)the National Natural Science Foundation of China(Nos.11701440 and 11626181).
文摘A graph is outer-1-planar if it can be drawn in the plane so that all vertices are on the outer face and each edge is crossed at most once.Zhang et al.(Edge covering pseudo-outerplanar graphs with forests,Discrete Math 312:2788-2799,2012;MR2945171)proved that the linear arboricity of every outer-1-planar graph with maximum degree△is exactly[△/2] provided that△=3or△≥5 and claimed that there are outer-1-planar graphs with maximum degree △=4 and linear arboricity[[(O+1)/2]=3.It is shown in this paper that the linear arboricity of every outer-1-planar graph with maximum degree 4 is exactly 2 provided that it admits an outer-1-planar drawing with crossing distance at least 1 and crossing width at least 2,and moreover,none of the above constraints on the crossing distance and Crossing width can be removed..Besides,a polynomial-time algorithm for constructing a path-2-coloring(i.e.,an edge 2-coloring such that each color class induces a linear forest,a disjoint union of paths)of such an outer-1-planar drawing is given.
基金Supported by National Natural Science Foundation of China(Grant Nos.11871055,11701440)。
文摘The equitable tree-coloring can formulate a structure decomposition problem on the communication network with some security considerations.Namely,an equitable tree-Zc-coloring of a graph is a vertex coloring using k distinct colors such that every color class induces a forest and the sizes of any two color classes differ by at most one.In this paper,we show some theoretical results on the equitable tree-coloring of graphs by proving that every d-degenerate graph with maximum degree at most Δ is equitably tree-fc-colorable for every integer k≥(Δ+1)/2 provided that Δ≥9.818d,confirming the equitable vertex arboricity conjecture for graphs with low degeneracy.
基金This work is partially supported by National Natural Science foundation of China Doctoral foundation of the Education Committee of China.
文摘The linear arboricity la(G) of a graph G is the minimum number of linear forests which partition the edges of G. Akiyama, Exoo and Harary conjectured that la(G) = [△(G)+1/2] for any regular graph G. In this paper, we prove the conjecture for some composition graphs, in particular, for complete multipartite graphs.
基金Supported by NSFC(Grant Nos.11601093 and 11671296)
文摘A linear directed forest is a directed graph in which every component is a directed path.The linear arboricity la(D) of a digraph D is the minimum number of linear directed forests in D whose union covers all arcs of D. For every d-regular digraph D, Nakayama and P′eroche conjecture that la(D) = d + 1. In this paper, we consider the linear arboricity for complete symmetric digraphs,regular digraphs with high directed girth and random regular digraphs and we improve some wellknown results. Moreover, we propose a more precise conjecture about the linear arboricity for regular digraphs.
基金supported by the Wellcome Trust(grant No.103852).
文摘The nervous system function requires a precise but plastic neural architecture.The neuronal shape dictates how neurons interact with each other and with other cells,being the morphology of dendrites and axons the central determinant of the functional properties of neurons and neural circuits.The topological and structural morphology of axons and dendrites defines and determines how synapses are conformed.The morphological diversity of axon and dendrite arborization governs the neuron’s inputs,synaptic integration,neuronal computation,signal transmission,and network circuitry,hence defining the particular connectivity and function of the different brain areas.
基金supported by AHA Career Development Award 938683 (to PJD)NIH grant R01MH123700 (to MLD)
文摘Since the first electron micrograph of“lace-like structures”over 75 years ago,the endoplasmic reticulum(ER)is now viewed as a highly dynamic,constantly remodeling,continuous network of tubules and cisternae that plays an important role in a broad range of cellular activities from calcium regulation to protein synthesis and trafficking.In neurons,the ER extends from the soma through the axon to presynaptic terminals,and throughout the dendritic arbor into as many as half of all postsynaptic dendritic spines at any given time(Falahati et al.,2022).
文摘目的探讨外周血miR-141、miR-451a与弥漫大B细胞淋巴瘤(diffuse large B-cell lymphoma,DLBCL)患者化疗应答的预测价值。方法选取2021年6月至2023年4月我院92例DLBCL患者作为DLBCL组,根据化疗效果分为化疗无效亚组(n=29)与化疗有效亚组(n=63)。随机选取同期92例入院体检健康者为对照组,采用实时荧光定量聚合酶链反应测定miR-141、miR-451a相对表达量。比较DLBCL组与健康对照组外周血miR-141、miR-451a表达,以logistic回归模型分析筛选DLBCL患者化疗应答影响因素,相关性分析DLBCL患者外周血miR-141、miR-451a与国际预后指数(international prognositic index,IPI)评分、Ann Arbor分期间相关性,受试者工作特征(receiver operating characteristic,ROC)曲线评价DLBCL患者miR-141、miR-451a单项检测及联合检测预测化疗应答的价值。结果DLBCL患者外周血miR-141、miR-451a表达均低于健康对照组(P<0.05);logistic回归分析结果显示Ann Arbor分期、IPI评分均为DLBCL患者化疗应答独立危险因素,外周血miR-141、miR-451a均为DLBCL患者化疗应答性独立保护因素(P<0.05);DLBCL患者外周血miR-141、miR-451a与IPI评分、Ann Arbor分期均具有显著负相关关系(P<0.05);外周血miR-141、miR-451a单独预测DLBCL患者化疗应答的曲线下面积(area under the curve,AUC)值分别为0.770、0.794,二者联合预测AUC值高达0.929,明显高于miR-141、miR-451a单独预测,此时灵敏度、特异度分别为86.21%、85.71%。结论DCBCL患者血清miR-141、miR-451a表达下调,且与应答有关,检测二者水平,可预测DCBCL患者化疗应答,为临床工作提供参考。
文摘A graph G is called d-degenerate if every subgraph of G has a vertex of degree at most d.It was known that planar graphs are 5-degenerate and every planar graph without k-cycles for some prescribed k∈{3,5,6}is 3-degenerate.In this paper,we show that if G is a planar graph without kites and 9-or 10-cycles,then G is 3-degenerate,hence 4-choosable and list vertex 2-arborable.
基金supported by the Earmarked fund for China Agriculture Research System of MOF and MARA(Grant No.CARS-41-G01).
文摘Background Salmonella enterica serovar Enteritidis(S.Enteritidis)is a global foodborne pathogen that poses a significant threat to human health,with poultry being the primary reservoir host.Therefore,addressing S.Enteritidis infections in poultry is crucial to protect human health and the poultry industry.In this study,we investigated the effect of co-housing Arbor Acres(AA)chickens,a commercial breed susceptible to S.Enteritidis,with Tibetan chickens,a local breed resistant to S.Enteritidis infection,on the resistance of the latter to the pathogen.Results Ninety-six 1-day-old Tibetan chickens and 961-day-old AA chickens were divided into a Tibetan chicken housed alone group(n=48),an AA chicken housed alone group(n=48),and a co-housed group(48 birds from each breed for 2 cages).All birds were provided the same diet,and the experimental period lasted 14 d.At d 7,all chickens were infected with S.Enteritidis,and samples were collected at 1-,3-,and 7-day-post-infection.We found that the body weight of AA chickens significantly increased when co-housed with Tibetan chickens at 1-and 3-day-post-infection(P<0.05).In addition,the cecal S.Enteritidis load in AA chickens was significantly reduced at 1-,3-,and 7-day-post-infection(P<0.05).Furthermore,the inflammatory response in AA chickens decreased,as evidenced by the decreased expression of proinflammatory cytokines NOS2,TNF-α,IL-8,IL-1β,and IFN-γin their cecal tonsils(P<0.05).Co-housing with Tibetan chickens significantly increased the height of villi and number of goblet cells(P<0.05),as well as the expression of claudin-1(P<0.05),a tight junction protein,in the jejunum of AA chickens.Further analysis revealed that co-housing altered the gut microbiota composition in AA chickens;specifically,the relative abundances of harmful microbes,such as Intestinimonas,Oscillibacter,Tuzzerella,Anaerotruncus,Paludicola,and Anaerofilum were reduced(P<0.05).Conclusions Our findings indicate that co-housing with Tibetan chickens enhanced the resistance of AA chickens to S.Enteritidis infection without compromising the resistance of Tibetan chickens.This study provides a novel approach for Salmonella control in practical poultry production.
基金supported by the Shaanxi FundamentalScience Research Project for Chemistry&Biology(grant no.22JHQ049)Basic Research Program of Natural Sciencesof Shaanxi Province(2019JM-339).
文摘Pygmy lorises are arboreal primates primarily found in forest environments across Southeast Asia(Nekaris 2014).Theyhave a diverse diet,including plant secretions,nectar,fruits,invertebrates,tree bark,and bird eggs.All 9 known speciesof pygmy lorises are listed as globally endangered species(Nekaris 2014).Pygmy lorises exhibit a range of unique phenotypic characteristics rarely seen among primates.
