检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:郝萃菊[1]
出 处:《数学的实践与认识》2014年第4期241-250,共10页Mathematics in Practice and Theory
摘 要:设G是m阶连同图,我们用S_n^G(n=km+1)表示把kG的每个分支的d_i度点分别与星图S_k+1的k个1度点重迭后得到的图,Y^(SG)(r_1n,n)表示把r_1S_n^G中每个分支的k度点依次与图的k度点邻接后得到的图,Y^(SG)(r_2λ_1,n)表示把τ_2Y^(SG)(τ_1n,n)中每个分支的r_1+k度点依次与图S_n^G的k度点邻接后得到的图,若k≥3,用Y^(sG)(r_kλ__(k-1),n)表示把τ_kY^(sG)(r_(k-1)λ_(k-2),n)中每个分支的τ_(k-1)+k度顶点依次与图S_n^G的k度点邻接后得到的图,这里λ_k=r_kλ_(k-1)+n.运用图的伴随多项式的性质,证明了一类新的图簇Y^(sG)(r_kλ__(k-1),n)∪β_kS_n^G的伴随多项式的因式分解定理,进而得到了这类图的补图的色等价图.Let G be a connected graph with m vertices and let SGn (n =km + 1) be the graph consisting of kG and Sk+1 by coinciding a vertex of degree diof each component of kG with k vertices of degree 1 of Sk+1.We denote by YSG (r1n,n) the graph consisting of (r1 + 1)SGn by adjacenting the vertex of degree k of every component of r1SGn with the vertex of degree k of SGn,respectively,and let YSG (r2λ1,n) be the graph obtained from r2YSG (r1n,n)and SGn by adjacenting the vertex of degree r1 + k of every component of r2YSG (r1n,n)with the vertex of degree k of SGn,respectively,If k ≥ 3,YSG (rkλk-1,n) be the graph consisting of rkYSG (rk-1λk-2,n) and SGn by adjacenting the vertex of degree rk-1 + k of every component of rkYSG (rk-1λk-2,n) with the vertex of degree k of SGn,respectively,where λk =rkλk-1 + n,By applying the properties of adjoint polynomials,We prove that factorization theorem of adjoint polynomials of a kind of new graphs YSG (rkλk-1,n)UβkSGn,Furthermore,We obtain structure characteristics of chromatically equivalent graphs of their complements.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.173