|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | On the adjacent-vertex-strongly-distinguishing total coloring of graphs显示文摘For any vertex u∈V(G), let TN(U)={u}∪{uv|uv∈E(G), v∈v(G)}∪{v∈v(G)|uv∈E(G)}and let f be a total k-coloring of G. The total-color neighbor of a vertex u of G is the color set Cf(u)={f(x)|x∈TN(U)}. For any two adjacent vertices x and y of V(G)such that Cf(x)≠Cf(y), we refer to f as a k-avsdt-coloring of G('avsdt'is the abbreviation of'adjacent-vertex-strongly- distinguishing total'). The avsdt-coloring number of G, denoted by Xast(G), is the minimal number of colors required for a avsdt-coloring of G. In this paper, the avsdt-coloring numbers on some familiar graphs are studied, such as paths, cycles, complete graphs, complete bipartite graphs and so on. We proveΔ(G)+1≤Xast(G)≤Δ(G)+2 for any tree or unique cycle graph G. | ZHANG ZhongFu CHENG Hui YAO Bing LI JingWen CHEN XiangEn XU BaoGen | 2008 | Science China Mathematics2008，51，3： | 74 |
| 2 | Fractional Domination of the Cartesian Products in Graphs显示文摘Let G =(V,E) be a simple graph.For any real function g :V-→ R and a subset S V,we write g(S) =∑v∈Sg(v).A function f :V-→ [0,1] is said to be a fractional dominating function(F DF) of G if f(N [v]) ≥ 1 holds for every vertex v ∈ V(G).The fractional domination number γf(G) of G is defined as γf(G) = min{f(V)|f is an F DF of G }.The fractional total dominating function f is defined just as the fractional dominating function,the difference being that f(N(v)) ≥ 1 instead of f(N [v]) ≥ 1.The fractional total domination number γ0f(G) of G is analogous.In this note we give the exact values ofγf(Cm × Pn) and γ0f(Cm × Pn) for all integers m ≥ 3 and n ≥ 2. | Baogen XU | 2015 | Journal of Mathematical Research with Applications2015，35，3： | 3 |
| 3 | A universal pipeline for mobile mRNA detection and insights into heterografting advantages under chilling stress显示文摘Heterografting has long been used to enhance the chilling tolerance of temperature-sensitive crops,including watermelon,whose mechanism is known to involve bidirectional long-distance mRNA movements.Despite several studies reporting on mobile mRNA(mb-mRNA)profiles in plants,accurate identification of mb-mRNAs is challenging owing to an array of technical problems.Here,we developed a bioinformatical pipeline that took most of the known technical concerns into consideration and is considered to be a universal tool for mb-mRNA detection in heterografts.By applying this pipeline to a commercial watermelon–bottle gourd heterografting system,we detected 130 and 1144 mb-mRNAs upwardly and 167 and 1051 mb-mRNAs downwardly transmitted under normal and chilling-stress conditions,respectively.Quantitative real-time PCR indicated a high accuracy rate(88.2%)of mb-mRNA prediction with our pipeline.We further revealed that the mobility of mRNAs was not associated with their abundance.Functional annotation and classification implied that scions may convey the stress signal to the rootstock,subsequently triggering energy metabolism reprogramming and abscisic acid-mediated stress responses by upward movement of effective mRNAs,ultimately leading to enhanced chilling tolerance.This study provides a universal tool for mb-mRNA detection in plant heterografting systems and novel insights into heterografting advantages under chilling stress. | Ying Wang Lingping Wang Nailin Xing Xiaohua Wu Xinyi Wu Baogen Wang Zhongfu Lu Pei Xu Ye Tao Guojing Li Yuhong Wang | 2020 | Horticulture Research2020，7，1： | 3 |
| 4 | Development and application of the new BPM system data processing program at Hefei light source显示文摘A data processing program has been applied for the new beam position monitor (BPM) system of the storage ring at Hefei Light Source (HLS). The new BPM system in the upgrade project will be equipped with Libera Brilliance BPM processors to replace the old Bergoz MX-BPM processors. The embedded Linux system on Libera has completed some important work, including instrument status check,data acquisition, position calculation, EPICS IOC data release,and so on. A new EPICS record type has been developed to recalculate the beam position with log-ratio method. The property of the new position data was analyzed in the time and frequency domain. The results show that the rms value of beam position measurement resolution can be up to submicron. Preliminary studies have been carried out on the measurement of the tune and the beam lifetime with this new BPM system. | MA Tianji YANG Yongliang SUN Baogen ZOU Junying LU Ping ZHOU Zeran XU Hongliang | 2012 | Nuclear Science and Techniques2012，23，5： | 2 |
| 5 | Vertex-distinguishing total colorings of graphs显示文摘 | ZHANG Zhongfu QIU Pengxiang XU Baogen | 2008 | Ars Combinatoria2008，87，： | 1 |
| 6 | Vertex-distinguishing total coloring of graphs 显示文摘 | Zhang Zhongfu Qiu Pengxiang Xu Baogen | 2008 | Ars Combinatoria2008，87，： | 1 |
| 7 | On signed edge domination of graphs显示文摘 | Xu baogen | | 0，，01： | 1 |
| 8 | On signed edge domination numbers of graphs显示文摘 | BAOGEN XU | 2001 | Discrete Math2001，，239： | 1 |
| 9 | On signed cycle domination in graphs显示文摘 | Baogen Xu | | 0，，04： | 1 |
| 10 | On signed edge domination numbers of graphs显示文摘 | Baogen Xu | | 0，，1： | 1 |
| 11 | Vertexdistinguishing total coloring of graphs 显示文摘 | ZHANG Zhongfu QIU Pengxiang XU Baogen | 2008 | Ars Combinatoria2008，87，： | 1 |
| 12 | vertex-distinguishing total colorings of graphs 显示文摘 | ZHANG Zhongfu QIU Pengxiang XU Baogen | 2008 | Ars Combinatoria2008，87，： | 1 |
| 13 | On signed edge total domination numbers of graphs显示文摘 | Jinfeng Zhao Baogen Xu | | 0，，02： | 1 |
| 14 | verter - dis- tinguishing total colourings of graphs 显示文摘 | ZHANG zhongfu QIU Pengxiang XU Baogen | 2008 | Ars Combinatoria2008，87，： | 1 |
| 15 | On minus domination and signed domination in graphs显示文摘 | Baogen Xu | | 0，，04： | 1 |
| 16 | Extremal graphs for inequalities involving domination parameters显示文摘 | Xu Baogen Cockayne E J Haynes T W Hedetniemi S T and Zhou S | 2000 | Discrete Math2000，，216： | 1 |
| 17 | A note on the lower bounds of signed domination number of a graph 显示文摘 | Zhang Z Xu Baogen Li Y and Liu L | 1999 | Discrete Math1999，，195： | 1 |
| 18 | On Signed Edge Domination Numbers of Graphs显示文摘 | Xu Baogen | 2001 | Discrete Math2001，239，13： | 1 |
| 19 | On signed cycle domination in graphs 显示文摘 | Xu Baogen | 2009 | Discrete Math2009，309，4： | 1 |
| 20 | A note on the lower bounds of signed domination number of a graph 显示文摘 | Zhang Z Xu Baogen Li Y and Liu L | 1999 | Discrete Math1999，195，： | 1 |
您所在的机构暂未开通此部分的功能，请联系管理员