作者:何玉萍; 陈祥恩 期刊:《数学季刊》 2019年第03期
Let G be a simple graph and f be a proper total coloring(or a total coloring in brief) of G. For any vertex u in G, Cf(u) denote the set of colors of vertex u and edges which incident with vertex u. Cf(u) is said to be the color set of vertex u under f. If Cf(u) = Cf(v)for any two distinct vertices u and v of G, then f is called vertex-distinguishing total coloring of G(in brief VDTC), a vertex ...
作者:GUO; Jing; CHEN; Xiang-en 期刊:《数学季刊》 2017年第04期
Let G be a simple graph with no isolated edge. An/-total coloring of a graphG is a mapping Ф : V(G) U E(G) → (1, 2,…… , k) such that no adjacent vertices receive thesame color and no adjacent edges receive the same color. An/-total coloring of a graph G issaid to be adjacent vertex distinguishing if for any pair of adjacent vertices u and v of G, wehave CФ(u) ≠ CФ(v), where CФ(u...
作者:杨龙海 期刊:《中国医学文摘·耳鼻咽喉科学》 2014年第03期
Objective To detect the plasma concentration of OLC1(overexpressed in lung cancer 1)protein as a potential cancer biomarker,and evaluating its clinical application value in the diagnosis of non-small cell lung cancer(NSCLC).Methods We prepared OLC1 antibody with OLC1 full length protein,in 5-6-week old Bal B/c mice.Each mouse was immunized four times at a dose of