您要查找的是不是:
- Let h(G,x) denote the adjoint polynomial of a Graph G. The chromatic uniqueness and chomatic equivalence from the complement of Graph G are studied. h(G;x)表示图G的伴随多项式;它从图G的补图出发研究色惟一和色等价.
- In the paper, the propertices of the roots of adjoint polynomial for a class of graph is investigated, and prove the roots to be single multiple. 摘要研究了一类图伴随多项式的根的性质,并给出了这类图的伴随根是单重的。
- Let G be a triangle-free graphs,in this paper,we give a formula of the derivative and two formula of the integral for the adjoint polynomial h(G,x) of G. 设G是不含三角形的图 ,本文给出了G的伴随多项式h(G ,x)的导数和两个积分公式
- On the roots of adjoint polynomial of some graphs 几类图的伴随多项式根的研究
- SEVERAL RESULTS ON ADJOINT POLYNOMIAL OF GRAPHS 关于图的伴随多项式的几个结果
- The Roots of Adjoint Polynomial of the Graphs Contain Triangles 一类含三角形图的伴随多项式的根
- The properties of the adjoint polynomial of T_m(1,4,m-6) 图T_m(1,4,m-6)的伴随多项式的若干性质
- DIVISIBLE PROPERTIES OF ADJOINT POLYNOMIAL OF THE SPECIAL GRAPHS 特殊图的伴随多项式的整除特性
- A new method for proving the chromatically non-unique graphs is given by studying factorization their adjoint polynomials, and some structure characteristic is obtained. 摘要通过研究图的伴随多项式,给出了证明非色唯一图的一种新方法,并且得到了若干图簇的色等价图的结构性质。
- An Investigation on the Roots of Adjoint Polynomial for a Class of Graph 一类图的伴随多项式根的研究
- We give a new method for proving the chromatic non-uniqueness of graphs by studying their adjoint polynomials, we obtain some structure characteristic of the chromatic equivalent graphs of kinds of graphs. 摘要通过研究图的伴随多项式的因式分解,给出并证明了若干图簇的色等价图的结构定理。
- THE FACTORIZATION OF ADJOINT POLYNOMIAL OF GRAPHS OF SD-SHAPE WITH CHROMATIC EQUIVALENCE ANALYSIS SD型图簇的伴随多项式的因式分解及色性分析
- Some Important Results and Discussion about the Roots of the Adjoint Polynomial of the Complements of Fn 关于图Fn补图伴随多项式根的讨论和相关结果
- Some Important Results and Discussion about the Roots of the Adjoint Polynomial of the Complements of F_n 关于图F_n补图伴随多项式根的讨论和相关结果
- adjoint polynomial 伴随多项式
- :In this paper, we make use of the minimum root of adjoint polynomial of graph G, to find out two classes graphs which are irreducible, (G) = (G) + 1 and R(G) = -2 and the complements of these graphs are chromatic unique . 利用图G的伴随多项式的最小根的性质,通过比较伴随多项式的末项的方法,找到了两类 n 个点n+1 条边且 R(G)= -2 的图簇,其补图是色唯一的。
- A complete quartic polynomial consists of 15 terms. 一个完整四次的多项式由15项组成。
- The properties of adjoint polynomials on a kind of graphs 一类图的伴随多项式的性质
- On the fourth coefficients of adjoint polynomials of some graphs 关于几类图族伴随多项式的第四项系数
- Characteristic polynomial, Cayley-Hamilton theorem. 特征多项式和那个定理。
- 今日热词
-
- 深远海浮式风电平台 - deep-sea floating wind power platform
-
- 京雄高速公路 - Beijing-Xiongan expressway
-
- 农业及相关产业增加值 - the added value of agriculture and related industries