期刊文献+
共找到342篇文章
< 1 2 18 >
每页显示 20 50 100
The Factorization of Adjoint Polynomials of E^G(i)-class Graphs and Chromatically Equivalence Analysis 被引量:15
1
作者 ZHANG Bing-ru YANG Ji-ming 《Chinese Quarterly Journal of Mathematics》 CSCD 北大核心 2008年第3期376-383,共8页
Let Sn be the star with n vertices, and let G be any connected graph with p vertices. We denote by Eτp+(r-1)^G(i) the graph obtained from Sr and rG by coinciding the i-th vertex of G with the vertex of degree r ... Let Sn be the star with n vertices, and let G be any connected graph with p vertices. We denote by Eτp+(r-1)^G(i) the graph obtained from Sr and rG by coinciding the i-th vertex of G with the vertex of degree r - 1 of S,, while the i-th vertex of each component of (r - 1)G be adjacented to r - 1 vertices of degree 1 of St, respectively. By applying the properties of adjoint polynomials, We prove that factorization theorem of adjoint polynomials of kinds of graphs Eτp+(r-1)^G(i)∪(r - 1)K1 (1 ≤i≤p). Furthermore, we obtain structure characteristics of chromatically equivalent graphs of their complements. 展开更多
关键词 chromatic polynomial adjoint polynomials FACTORIZATION chromatically equivalent graph structure characteristics
在线阅读 下载PDF
RECURSIVE FORMULA FOR CALCULATING THE CHROMATIC POLYNOMIAL OF A GRAPH BY VERTEX DELETION 被引量:1
2
作者 许进 《Acta Mathematica Scientia》 SCIE CSCD 2004年第4期577-582,共6页
A new recursive vertex-deleting formula for the computation of the chromatic polynomial of a graph is obtained in this paper. This algorithm is not only a good tool for further studying chromatic polynomials but also ... A new recursive vertex-deleting formula for the computation of the chromatic polynomial of a graph is obtained in this paper. This algorithm is not only a good tool for further studying chromatic polynomials but also the fastest among all the algorithms for the computation of chromatic polynomials. 展开更多
关键词 Graph Theory chromatic polynomial vertex-deleting recursive formula
在线阅读 下载PDF
Graph Description by the Chromatic Polynomials 被引量:1
3
作者 MA Hai-cheng LIU Hui-min ZHANG Hai-liang 《Chinese Quarterly Journal of Mathematics》 CSCD 2009年第1期46-52,共7页
By means of the chromatic polynomials, this paper provided a necessary and sufficient condition for the graph G being a mono-cycle graph(the Theorem 1), a first class hi-cycle graph and a second class bicycle graph... By means of the chromatic polynomials, this paper provided a necessary and sufficient condition for the graph G being a mono-cycle graph(the Theorem 1), a first class hi-cycle graph and a second class bicycle graph(the Theorem 2), respectively. 展开更多
关键词 mono-cycle graph bi-cycle graph chromatic polynomial chromatic equivalence
在线阅读 下载PDF
Some new generating function formulae of the two-variable Hermite polynomials and their application in quantum optics 被引量:1
4
作者 展德会 范洪义 《Chinese Physics B》 SCIE EI CAS CSCD 2014年第12期30-33,共4页
We derive some new generating function formulae of the two-variable Hermite polynomials, such as ∞∑n=0tm/m!Hn,2m(x),∞∑n=0sntm/n!m!H2n,2m(x,y),and ∞∑n=0sntm/n!m!H2n+l,2m+k(x,y).We employ the operator Herm... We derive some new generating function formulae of the two-variable Hermite polynomials, such as ∞∑n=0tm/m!Hn,2m(x),∞∑n=0sntm/n!m!H2n,2m(x,y),and ∞∑n=0sntm/n!m!H2n+l,2m+k(x,y).We employ the operator Hermite polynomial method and the technique of integration within an ordered product of operators to solve these problems, which will be useful in constructing new optical field states. 展开更多
关键词 generating function two-variable Hermite polynomials Hermite polynomial method technique of integral within an ordered product of operators
原文传递
New Bosonic Operator Ordering Identities Gained by the Entangled State Representation and Two-Variable Hermite Polynomials
5
作者 FAN Hong-Yi FAN Yue 《Communications in Theoretical Physics》 SCIE CAS CSCD 2002年第9期297-300,共4页
Based on the technique of integration within an ordered product of operators, we derive new bosonicoperators' ordering identities by using entangled state representation and the properties of two-variable Hermite ... Based on the technique of integration within an ordered product of operators, we derive new bosonicoperators' ordering identities by using entangled state representation and the properties of two-variable Hermite poly-nomials H and vice versa. In doing so, some concise normally (antinormally) ordering operator identities, such asa+man =:Hm,n(a+,a):, ana+m = (-i)m+n:Hm,n(ia+,ia): are obtained. 展开更多
关键词 OPERATOR ordering ENTANGLED state two-variable HERMITE polynomialS
在线阅读 下载PDF
New operator identities with regard to the two-variable Hermite polynomial by virtue of entangled state representation
6
作者 袁洪春 李恒梅 许雪芬 《Chinese Physics B》 SCIE EI CAS CSCD 2013年第6期162-165,共4页
By virtue of the entangled state representation we concisely derive some new operator identities with regard to the two-variable Hermite polynomial (TVHP). By them and the technique of integration within an ordered ... By virtue of the entangled state representation we concisely derive some new operator identities with regard to the two-variable Hermite polynomial (TVHP). By them and the technique of integration within an ordered product (IWOP) of operators we further derive new generating function formulas of the TVHP. They are useful in quantum optical theoretical calculations. It is seen from this work that by combining the IWOP technique and quantum mechanical representations one can derive some new integration formulas even without really performing the integration. 展开更多
关键词 two-variable Hermite polynomial entangled state representation operator identities
原文传递
New Bosonic Operator Ordering Identities Gained by the Entangled State Representation and Two-Variable Hermite Polynomials 被引量:3
7
作者 FANHong-Yi FANYue 《Communications in Theoretical Physics》 SCIE CAS CSCD 2002年第3期297-300,共4页
Based on the technique of integration within an ordered product of operators, we derive new bosonic operators, ordering identities by using entangled state representation and the properties of two-variable Hermite pol... Based on the technique of integration within an ordered product of operators, we derive new bosonic operators, ordering identities by using entangled state representation and the properties of two-variable Hermite polynomials , and vice versa. In doing so, some concise normally (antinormally) ordering operator identities, such as : are obtained. 展开更多
关键词 operator ordering entangled state two-variable Hermite polynomials
在线阅读 下载PDF
Chromatically Equivalent Graphs with P(G, λ) = (λ- λ_1)(λ-λ_2)λ ̄(n+1)
8
作者 韩伯棠 《Journal of Beijing Institute of Technology》 EI CAS 1995年第2期122+115-122,共9页
The author finds out all of the graphs with the same chromatic polynomial and proves some relevant theorems and corollaries.
关键词 trees(mathematics) coloring (mathematics) polynomials/chromatic polynomials
在线阅读 下载PDF
CLASSIFICATION OF COMPLETE 5-PARTITE GRAPHS AND CHROMATICITY OF 5-PARTITE GRAPHS WITH 5n VERTICES
9
作者 ZhaoHaixing LiuRuying ZhangShenggui 《Applied Mathematics(A Journal of Chinese Universities)》 SCIE CSCD 2004年第1期116-124,共9页
For a graph G,P(G,λ)denotes the chromatic polynomial of G.Two graphs G and H are said to be chromatically equivalent,denoted by G~H,if P(G,λ)=p(H,λ).Let [G]={H|H~G}.If [G]={G},then G is said to be chromaticall... For a graph G,P(G,λ)denotes the chromatic polynomial of G.Two graphs G and H are said to be chromatically equivalent,denoted by G~H,if P(G,λ)=p(H,λ).Let [G]={H|H~G}.If [G]={G},then G is said to be chromatically unique.For a complete 5 partite graph G with 5n vertices, define θ(G)=(α(G,6)-2 n+1 -2 n-1 + 5)/2 n-2 ,where α(G,6) denotes the number of 6 independent partition s of G.In this paper, the authors show that θ(G)≥0 and determine all g raphs with θ(G)=0,1,2,5/2,7/2,4,17/4.By using these results the chromaticity of 5 partite graphs of the form G-S with θ(G)=0,1,2,5/2,7/2,4,17/4 is inve stigated,where S is a set of edges of G.Many new chromatically unique 5 partite graphs are obtained. 展开更多
关键词 chromatic polynomial χ closed chromatic uniqueness.
在线阅读 下载PDF
Chromatic Uniqueness of K_4-Homeomorphs with Girth 8
10
作者 Weina SHI Yongliang PAN Yan ZHAO 《Journal of Mathematical Research with Applications》 CSCD 2012年第3期269-280,共12页
In this paper, we determine all graphs of K4-homeomorphs of girth 8 which are chromatically unique.
关键词 chromatic polynomial chromatically unique graph K4-homeomorph.
原文传递
A Complete Solution to the Chromatic Equivalence Class of Graph B_(n-8,1,4)
11
作者 Yaping MAO Chengfu YE Shumin ZHANG 《Journal of Mathematical Research with Applications》 CSCD 2012年第3期253-268,共16页
Two graphs are defined to be adjointly equivalent if and only if their complements are chromatically equivalent. Using the properties of the adjoint polynomials and the fourth character R4(G), the adjoint equivalenc... Two graphs are defined to be adjointly equivalent if and only if their complements are chromatically equivalent. Using the properties of the adjoint polynomials and the fourth character R4(G), the adjoint equivalence class of graph Bn-8,l,4 is determined. According to the relations between adjoint polynomial and chromatic polynomial, we also simultaneously determine the chromatic equivalence class of Bn-8,l,4 that is the complement of Bn-8,l,4. 展开更多
关键词 chromatic equivalence class adjoint polynomial the smallest real root the fourth character.
原文传递
On Chromatically Equivalence of a Class of Graphs
12
作者 ZHANG Shu-min 《Chinese Quarterly Journal of Mathematics》 CSCD 2010年第2期308-311,共4页
A class of new graphs is defined. A sufficient condition for pairs of these graphs to be chromatically equivalent is proven.
关键词 chromatic polynomial chromatically equivalent graphs ladder graphs
在线阅读 下载PDF
An Approach to Chromaticity of K_4-homeomorphs
13
作者 PENGYan-ling 《Chinese Quarterly Journal of Mathematics》 CSCD 2004年第3期253-261,共9页
We introduce a new method for studying the chromaticity of K4-homeomorphs,by which some new results are obtained.
关键词 K4-homeomorphs chromatic equivalence chromatic polynomial
在线阅读 下载PDF
The Relation on the Coefficients and Roots of Adjoint Polynomial and Its Application
14
作者 冶成福 王波 刘儒英 《Chinese Quarterly Journal of Mathematics》 CSCD 2009年第3期317-324,共8页
The parameter R(G) is the function about the front three coeffcients of the adjoint polynomial of graph G. In the paper, the range of R(G) is given when β(G) 〈 β(Dn), where β(G) is the minimum root of th... The parameter R(G) is the function about the front three coeffcients of the adjoint polynomial of graph G. In the paper, the range of R(G) is given when β(G) 〈 β(Dn), where β(G) is the minimum root of the adjoint polynomial of graph G and the chromatically equivalent classification of tDn is completely depicted.Furthermore, a sufficient and necessary condition for the class of graphs to be chromatically unique is obtained. 展开更多
关键词 chromatically equivalent adjoint polynomial the least root
在线阅读 下载PDF
Chromatic Uniqueness of the Complement of T_m(l, 4, m - 6)
15
作者 ZHANGShu-min 《Chinese Quarterly Journal of Mathematics》 CSCD 2004年第2期133-141,共9页
In the paper, we prove that the complement of Tm(1,4,m-6)(m> 10) is chromatically unique if and only if m≠5k(k≥2).
关键词 the least root adjoint polynomial chromatic uniqueness
在线阅读 下载PDF
On Chromatic Polynomials of Complements of All Wheels with Any Missing Consecutive Spokes * 被引量:2
16
作者 郝荣霞 刘彦佩 《Journal of Mathematical Research and Exposition》 CSCD 北大核心 2003年第4期579-585,共7页
In this paper, a new method has been used to calculate the chromatic polynomials of graphs. In particular, the chromatic polynomials of complements of all wheels with any missing consecutive spokes are given.
关键词 chromatic polynomial WHEELS complement.
在线阅读 下载PDF
几类a圈图的色多项式
17
作者 张梦婷 吴晓霞 《闽南师范大学学报(自然科学版)》 2025年第2期124-132,共9页
通过在三圈图的基础上构造a圈图,应用删除-收缩定理递推获得了几类a圈图的色多项式。
关键词 a圈图 色多项式 三圈图
在线阅读 下载PDF
A NEW METHOD TO FIND CHROMATIC POLYNOMIAL OF GRAPH AND ITS APPLICATIONS 被引量:35
18
作者 刘儒英 《Chinese Science Bulletin》 SCIE EI CAS 1987年第21期1508-1509,共2页
Let G be a simple graph, and let f(G, t) be its chromatic polynomial. We
关键词 chromatic SUBGRAPH polynomial WRITE FIND SPANNING LETTER
在线阅读 下载PDF
On Chromatic Polynomials of Some Kinds of Graphs 被引量:1
19
作者 Rong-xiaHao Yan-peiLiu 《Acta Mathematicae Applicatae Sinica》 SCIE CSCD 2004年第2期239-246,共8页
In this paper,a new method is used to calculate the chromatic polynomials of graphs.The chro-matic polynomials of the complements of a wheel and a fan are determined.Furthermore,the adjoint polynomialsof F_n with n ve... In this paper,a new method is used to calculate the chromatic polynomials of graphs.The chro-matic polynomials of the complements of a wheel and a fan are determined.Furthermore,the adjoint polynomialsof F_n with n vertices are obtained.This supports a conjecture put forward by R.Y.Liu et al. 展开更多
关键词 chromatic polynomial WHEELS FANS COMPONENT
原文传递
TWO-VARIABLE JACOBI POLYNOMIALS FOR SOLVING SOME FR ACTIONAL PA RTIAL DIFFERENTIAL EQUATIONS
20
作者 Jafar Biazar Khadijeh Sadri 《Journal of Computational Mathematics》 SCIE CSCD 2020年第6期879-902,共24页
Tw o variable Jacobi polynomials,as a two-dimensional basis,are applied to solve a class of temporal fractional partial differential equations.The fractional derivative operators are in the Caputo sense.The operationa... Tw o variable Jacobi polynomials,as a two-dimensional basis,are applied to solve a class of temporal fractional partial differential equations.The fractional derivative operators are in the Caputo sense.The operational matrices of the integration of integer and fractional orders are presented.Using these matrices together with the Tau Jacobi method converts the main problem into the corresponding system of algebraic equations.An error bound is obtained in a two-dimensional Jacobi-weighted Sobolev space.Finally,the efficiency of the proposed method is demonstrated by implementing the algorithm to several illustrative examples.Results will be compared witli those obtained from some existing methods. 展开更多
关键词 Fractional partial differential equation two-variable Jacobi polynomials Caputo derivative Error bound.
原文传递
上一页 1 2 18 下一页 到第
使用帮助 返回顶部