In this paper , we are concerned with the generalized primitive exponents of the digraphs with given order and girth 2
A doubly nonnegative matrix a is defined to be an entrywise nonnegative and positive semidifined matrix
16 wu t r , lei n , cheng j s , wu wen - tsn . formulae for theblending of pipe surfaces . northeast
7 lee j - h , park h . morphological development and transformation of b ezier curves based on ribs and fans . in proc
6 park h . choosing nodes and knots in closed b - spline curve interpolation to point data . computer - aided design , 2001 , 33 : 967 - 974
Proved that kn - h has an ascending star decomposition when the size of h is less than 4p , where h is a subgraph of the complete graph kn
To pancyclic graphs , bondy ( 1971 ) proves a classic theorem that every hamiltonian graph of order n and size exceeding n 2 / 4
The total sound radiation power can be reduced by counteracting the adjoint coefficients of sound radiation modes of the first n radiation modes
A general estimation of the nth derivation of the function is presented by using the principle of the inductive model and the characters of the bounded functions
( 3 ) we give an upper bound for lewin index , which is related to generalized primitive exponents of primitive digraph of order n and girth 2 , determine the index set of this class digraph and discuss the extreme cases
用n阶造句挺难的，這是一个万能造句的方法
The main results are : ( 1 ) we give an upper bound for kth generalized primitive exponents of primitive digraphs with order n and girth 2 , and determine the exponent set of this class digraphs in section 2
( 2 ) we give an upper bound for kth generalized primitive exponents of non - primitive digraphs with order n and girth 2 , determine the exponent set of this class digraphs in section 3 , and discuss the extreme cases
By introducing proper stretchy variable and constructing boundary layer function , it concludes n - order approximate solution , and using theory of differential inequality , uniformly validity of asymptotic expansion is proved
Let a graph g is a simple graph of order n . a graph of order n is called pancyclic if it contains cycles of every length l , 3 < l < n , and is called weakly pancyclic if it contains cycles of all lengths between its girth and circumference
This article brings forward a new prognostic model , which is based on n _ rank transfer probability coming from the theory of random process and restricted by minimum confidence and adjustment matrix . using this model , ultimately prognostic result can be found
The independent index of a graph g , denoted by i ( g ) , is the number of independent sets in g . the trees of order n with the largest and the smallest independent index and the forest of order n with the largest and the smallest independent index are known
In this paper , we brought forward the concept of ergodic matrix over finite field fq , simply discussed theory of finite field including property theory of finite field , calculation in finite field and construction from low - degree finite field to high - degree finite field
In section two , the circular graphs with order n that the first row of their adjacent matrix is [ 01100 . . . 0011 ] and [ 010100 . . . 00101 ] are considered and we obtain the fractional chromatic number of them , include the chromatic number of the graphs whose first row of the adjacent matrix is [ 01100 . . . 0011 ] just while n is not the multiple of 3
After introducing the conventional edge detection operator and multiscale wavelet edge detection operator , we discussed the well quality of b - spline function > n - class derivative of gauss function n harmonic function and hermite function in wavelet theory and their concrete application in the image edge detection
The tree of order n with the second smallest independent index is also known . ( [ 1 ] , [ 6 ] ) in this paper , we mainly study the unicyclic graph of order n with independent index , the unicyclic graph of order n with the largest and the smallest independent index are know ( theorem 2 , theorem 3 ) . we also determine the unicyclic graph of order n with the second largest independent index ( theorem 4 , theorem 5 ) , and the unicyclic graph of order n with the second smallest independent index ( theorem 6 , theorem 7 )
手机版