完全解决图$\overline{B_{n-8,1,4}}$的色等价类

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 R₄（G）,the adjoint equivalence class of graph B_n-8,1,4 is determined.According to the relations between adjoint polynomial and chromatic polynomial,we also simultaneously determine the chromatic equivalence class of B_n-8,1,4 that is the complement of B_n-8,1,4.     

On the Differential Polynomial of a Graph

We introduce the differential polynomial of a graph. The differential polynomial of a graph G of order n is the polynomial B(G; x) :=∑?(G)k=-nB_k(G) x~(n+k), where B_k(G) denotes the number of vertex subsets of G with differential equal to k. We state some properties of B(G;x) and its coefficients.In particular, we compute the differential polynomial for complete, empty, path, cycle, wheel and double star graphs. We also establish some relationships between B(G; x) and the differential polynomials of graphs which result by removing, adding, and subdividing an edge from G.     

A Complete Solution to the Chromatic Equivalence Class of Graph (Bn-8,1,4)

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 adjoin...     

The Change-Base Issue for Ω-Categories

Let G ： Ω→Ω＇ be a closed unital map between commutative, unital quantales. G induces a functor G^- from the category of Ω-categories to that of Ω＇-categories. This paper is concerned with some basic properties of G^-. The main results are： （1） when Ω, Ω＇ are integral, G ： Ω→Ω＇ and F ： Ω＇→Ω are closed unital maps, F is a left adjoint of G^- if and only if F is a left adjoint of G; （2） G^- is an equivalence of categories if and only if G is an isomorphism in the category of commutative unital quantales and closed unital maps; and （3） a sufficient condition is obtained for G^- to preserve completeness in the sense that GA is a complete Ω＇-category whenever A is a complete Ω-category.     

Some results on derivations of MV-algebras

In this paper, we review some of their related properties of derivations on MValgebras and give some characterizations of additive derivations. Then we prove that the fixed point set of Boolean additive derivations and that of their adjoint derivations are isomorphic.In particular, we prove that every MV-algebra is isomorphic to the direct product of the fixed point set of Boolean additive derivations and that of their adjoint derivations. Finally we show that every Boolean algebra is isomorphic...     

C^N中多项式自同构的动力系统

This paper is assigned to discuss the dynamics of a special class of polynomial automorphisms of C^N which was shown to be dense in the group of the polynomial automorphisms.We give some results about the analytic and geometric properties of the filled-in Julia set and the nonwandering set.We also make a characterization of the stable and unstable manifold for the filled-in Julia set.Furthermore,the number of the fixes points for such maps is studied.     

Unimodality of Independence Polynomials of the Cycle Cover Product of Graphs

An independent set in a graph G is a set of pairwise non-adjacent vertices. Let i_k(G)denote the number of independent sets of cardinality k in G. Then its generating function ■is called the independence polynomial of G (Gutman and Harary, 1983). In this paper, we introduce a new graph operation called the cycle cover product and formulate its independence polynomial. We also give a criterion for formulating the independence polynomial of a graph. Based on the exact formulas,we prove s...     

THE UNIVERSAL DUAL COMODULE OF MODULE IN HOPF ALGEBRAS

The purpose of this paper is to present some dual properties of dual comodule.It turns out that dual comodule has universal property (cf.Theorem 2). Since (()~*, ()~O) isan adjoint pair (cf.Theorem 3), some nice properties of functor()~O are obtained. FinallyTheoram 4 provides that the cotensor product is the dual of the tensor product by (M_A     

σ-多项式的根

§ 1　IntroductionAll graphs considered are finite and simple.Undefined notation and terminology willconform to those in[1 ] .Let V(G) ,E(G) and Gdenote the vertex set,edge set and complement of a graph G,respectively. Let P(G,x) andσ(G,x) denote the chromatic polynomial andσ-polynomialof G,respectively.The log-concavity property of the chromatic polynomial andσ-polyno-mial of G has a close relation to their roots,which were well studied in[2 ,3] .Results onthe study of the roots of…     

给定零点的最近复系数多项式计算问题

Nearest polynomial with given properties has many applications in control theory and applied mathematics. Given a complex univariate polynomial f(z) and a zero α, in this paper we explore the problem of computing a complex polynomial f(z) such that f(α) = 0 and the distance ∥f-f ∥ is minimal. Considering most of the existing works focus on either certain polynomial basis or certain vector norm, we propose a common computation framework based on both general polynomial basis and general vector norm, and summarize the computing process into a four-step algorithm. Further, to find the explicit expression of f(z), we focus on two specific norms which generalize the familiar lp-norm and mixed norm studied in the existing works, and then compute f(z) explicitly based on the proposed algorithm. We finally give a numerical example to show the effectiveness of our method.     

A Complete Solution to the Chromatic Equivalence Class of Graph B_(n-8,1,4)

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 R_4(G),the adjoint equivalence class of graph B_(n-8,1,4) is determined.According to the relations between adjoint polynomial and chromatic polynomial,we also simultaneously determine the chromatic equivalence class of B_(n-8,1,4) that is the complement of B_(n-8,1,4).     

单圈图的伴随多项式的极小根（英文）

引入伴随多项式是为了从补图的角度研究色多形式,图的伴随多项式的极小根可用于判定色等价图.β（G）表示图G的伴随多项式的极小根.n表示n个顶点的单圈图的集合.分别确定了具有max{β（G）｜G∈Ωn}和min{β（G）｜G∈Ωn}的所有单圈图.     

一类图的伴随多项式的根

设G是不含三角形的简单图,本文讨论了G的伴随多项式h(G,x)的根的分布情况.     

一类图的伴随多项式的导数与积分

设Ｇ是不含三角形的图,本文给出了Ｇ的伴随多项式ｈ（Ｇ,ｘ）的导数和两个积分公式。     

伴随多项式的根与色等价图的刻画

文[2]给出了不含三角形图伴随多项式根的内插性质,本文研究了含三角形图的伴随多项式根的性质,在此基础上完整地刻画了■的色等价图,且给出这类图色唯一的充要条件.Cti表示有ti个顶点的圈;Dn表示Pn-2的一个1度点粘接下来K3的一个点得到的图.     

两类图色唯一的充分必要条件

利用图的伴随多项式的性质,给出了两类图色唯一的充分必要条件     

图$(\bigcup\limits_{i{\in}A}P_i){\bigcup}(\bigcup\limits_{j{\in}B}U_j)$伴随唯一的充要条件

设$h(G; x) =h(G)$和$[G]_h$分别表示图$G$的伴随多项式和伴随等价类. 文中给出了$[G]_h$的一个新应用. 利用$[G]_h$, 给出了图$H{\;}(H \cong G)$伴随唯一的充要条件, 其中$H=(\bigcup_{i{\in}A}P_i){\bigcup}(\bigcup_{j{\in}B}U_j)$, $A \subseteq A^{'}=\{1,2,3,5\} \bigcup \{2n|n \in N, n \geq 3\}$, $B \subseteq B^{'}     

LEVERRIER-LAGUERRE ALGORITHM FOR THE MATRIX POLYNOMIAL OF DEGREE TWO

1　ＩｎｔｒｏｄｕｃｔｉｏｎＬｅｔＡｂｅａｎ×ｎｍａｔｒｉｘ ,Ｉｎｄｅｎｏｔｅｓｔｈｅｕｎｉｔｍａｔｒｉｘｏｆｏｒｄｅｒｎ .Ａｎｄｌｅｔ ａ(λ) =ｄｅｔ(λＩｎ-Ａ) =λｎ+ ａ1λｎ- 1+… + ａｎ- 1λ+ ａｎ (1 .1 )ｂｅｔｈｅｃｈａｒａｃｔｅｒｉｓｔｉｃｐｏｌｙｎｏｍｉａｌｏｆＡ ,ｔｈｅａｄｊｏｉｎｔｍａｔｒｉｘｏｆλＩｎ-Ａｂｅ Ｂ(λ) =ａｄｊ(λＩｎ-Ａ) =λｎ- 1Ｉｎ+λｎ- 2 Ｂ1+… +λ Ｂｎ- 2 + Ｂｎ- 1. (1 .2 )Ｔｈｅｎ(λΙｎ-Ａ) - 1= Ｂ(λ) / ａ(λ) . (1 .3)　　Ａｗｅｌｌ ｋｎｏｗＬｅｖｅｒｒｉ…     

Coherent sequences of polynomial ideals on Banach spaces

This article deals with the relationship between an operator ideal and its natural polynomial extensions. We define the concept of coherent sequence of polynomial ideals and also the notion of compatibility between polynomial and operator ideals. We study the stability of these properties for maximal and minimal hulls, adjoint and composition ideals. We also relate these concepts with conditions on the underlying tensor norms (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)