POSETIZATIONS OF DIGRAPHS

The topic, posets and graphs, recently comes about as a new branch of combinatorics. This paper is one on the topic.Trying to solve a research problem posed by Trotter in [1]. we constructively prove the following theorem of the necessary and sufficient conditions for a digraph to be a posetable digraph.Theorem. A digraph D is a posetable digraph if and only if D—a contains no directed path between u and v for any arc a=(u, v) of D.     

A sufficient condition for kernel perfectness of a digraph in terms of semikernels modulo F

A kernel of a directed graph is a set of vertices which is both independent and absorbent. And a digraph is said to be kernel perfect if and only if any induced subdigraph has a kernel. Given a set of arcs F , a semikernel S modulo F is an independent set such that if some Sz-arc is not in F , then there exists a zS-arc. A sufficient condition on the digraph is given in terms of semikernel modulo F in order to guarantee that a digraph is kernel perfect. To do that we give a characterization of kernel perfectness which is a generalization of a previous result given by Neumann-Lara [Seminúcleos de una digrfica. Anales del Instituto de Matemticas 2, Universidad Nacional Autónoma de México, 1971]. And moreover, we show by means of an example that our result is independent of previous known sufficient conditions.     

On Hamiltonian Property of Cayley Digraphs

Let G be a finite group generated by S and C(G,S) the Cayley digraphs of G with connection set S.In this paper,we give some sufficient conditions for the existence of hamiltonian circuit in C(G,S),where G=Z_m ×H is a semiproduct of Z_m by a subgroup H of G.In particular,if m is a prime,then the Cayley digraph of G has a hamiltonian circuit unless G=Z_m×H.In addition,we introduce a new digraph operation,called φ-semiproduct of Γ₁ by Γ₂ and denot...     

DIGRAPH CATEGORIES AND LINE DIGRAPH FUNCTORS

The authors define line digraph functors on digraph category which are full and faith-ful and,as a consequence of the result,determine all homomorphisms in De Bruijn-Goodgraph category and automorphisms of Kautz digraph category.Moreover the authorsconsider a type of arc-full morphisms of digraph category such that F~n(f) is arc-full foreach functor F~n,and succeeding paper [9] study the strong homomorphisms of de Bruijn-Good digraph.     

ON ARC-TRANSITIVE CIRCULANT DIGRAPHS

Denote by c,(s)the circulant digraph with vertex set zn=[0,1,2……n-1]and symbol set s(≠-s)∈zn\[0].let x be the automorphism group of cn(S)and xo the stabilizer of o in x.then cn(S)is arctransitive if and only if xo acts transitively on s.in this paper,co(S)with xo is being the symmetric group is characterized by its symbot set .by the way all the arctransitive clcculant digraphs of degree 2are given.     

Linear arboricity of regular digraphs

A linear directed forest is a directed graph in which every component is a directed path.The linear arboricity la(D) of a digraph D is the minimum number of linear directed forests in D whose union covers all arcs of D. For every d-regular digraph D, Nakayama and P′eroche conjecture that la(D) = d + 1. In this paper, we consider the linear arboricity for complete symmetric digraphs,regular digraphs with high directed girth and random regular digraphs and we improve some wellknown results. Moreover, we propose a more precise conjecture about the linear arboricity for regular digraphs.     

Competition Numbers and Phytogeny Numbers of Connected Graphs and Hypergraphs

Let D be a digraph.The competition graph of D is the graph having the same vertex set with D and having an edge joining two different vertices if and only if they have at least one common out-neighbor in D.The phylogeny graph of D is the competition graph of the digraph constructed from D by adding loops at all vertices.The competition/phylogeny number of a graph is the least number of vertices to be added to make the graph a competition/phylogeny graph of an acyclic digraph.In this paper,we show that for any integer k there is a connected graph such that its phylogeny number minus its competition number is greater than k.We get similar results for hypergraphs.     

Digraphs and Inclusion Intervals of Brualdi-type for Singular Values

A complex matrix A is said to be a matrix realization of the digraph D if D is the associated digraph of A, and A is said to have the property B if every singular value of A is contained in the union of Brualdi-type intervals. A digraph D is said to be a forcible B-digraph if every matrix realization of D has the property B. In this paper, we give a sufficient condition for a matrix to have the property B and characterize the forcible B-digraphs.     

On Two-stage Estimate Based on Independent Estimate of Covariance Matrix

When an independent estimate of covariance matrix is available, we often prefer two-stage estimate （TSE）. Expressions of exact covarianee matrix of the TSE obtained by using all and some covariables in eovariance adjustment approach are given, and a necessary and sufficient condition for the TSE to be superior to the least square estimate and related large sample test is also established. Furthermore the TSE, by using some covariables, is expressed as weighted least square estimate. Basing on this fact, a necessary and sufficient condition for the TSE by using some covariables to be superior to the TSE by using all eovariables is obtained. These results give us some insight into the selection of covariables in the TSE and its application.     

On Sullivan��s conjecture on cycles in 4-free and 5-free digraphs

For a simple digraph G, let β(G) be the size of the smallest subset X■E(G) such that G-X has no directed cycles, and let γ(G) be the number of unordered pairs of nonadjacent vertices in G. A digraph G is called k-free if G has no directed cycles of length at most k. This paper proves that β(G) ≤ 0.3819γ(G) if G is a 4-free digraph, and β(G) ≤ 0.2679γ(G) if G is a 5-free digraph. These improve the results of Sullivan in 2008.     

Generalized Bessel numbers and some combinatorial settings

Stirling numbers and Bessel numbers have a long history, and both have been generalized in a variety of directions. Here, we present a second level generalization that has both as special cases. This generalization often preserves the inverse relation between the first and second kind, and has simple combinatorial interpretations. We also frame the discussion in terms of the exponential Riordan group. Then the inverse relation is just the group inverse, and factoring inside the group leads to many results connecting the various Stirling and Bessel numbers.     

On an identity for zeros of Bessel functions

In this paper our aim is to present an elementary proof of an identity of Calogero concerning the zeros of Bessel functions of the first kind. Moreover, by using our elementary approach we present a new identity for the zeros of Bessel functions of the first kind, which in particular reduces to some other new identities. We also show that our method can be applied for the zeros of other special functions, like Struve functions of the first kind, and modified Bessel functions of the second kind.     

On integral representation of Bessel function of the first kind

A first kind Fredholm integral equation with nondegenerate kernel is given, which particular solution is the Bessel function of the first kind. This equation is solved by means of Mellin transform pair.     

Bessel fusion multipliers

In this paper we study properties of a Bessel multiplier when the symbol involved belongs to lp. Furthermore, we introduce the concept of Bessel fusion multiplier which generalizes a Bessel multiplier for Bessel fusion sequences. We study their behavior when the symbol belongs to lp and some continuity properties.     

On Bessel integrals for reducible degenerate principal series representations

We discuss generalized Bessel integrals with nondegenerate characters, which are assigned to irreducible submodules of a reducible degenerate principal series representation of Sp(n,R). Then we give sufficient conditions for their vanishings which are based on the signatures of the nondegenerate characters. This consequently suggests a reasonable correspondence between open GLn(R)-orbits in the set of real symmetric matrices of size n and irreducible submodules of the reducible principal series representations.     

Inequalities involving modified Bessel functions of the first kind II

The intrinsic properties, including logarithmic convexity (concavity), of the modified Bessel functions of the first kind and some other related functions are obtained. Several inequalities involving functions under discussion are established.     

Degenerate Bernoulli polynomials, generalized factorial sums, and their applications

We prove a general symmetric identity involving the degenerate Bernoulli polynomials and sums of generalized falling factorials, which unifies several known identities for Bernoulli and degenerate Bernoulli numbers and polynomials. We use this identity to describe some combinatorial relations between these polynomials and generalized factorial sums. As further applications we derive several identities, recurrences, and congruences involving the Bernoulli numbers, degenerate Bernoulli numbers, generalized factorial sums, Stirling numbers of the first kind, Bernoulli numbers of higher order, and Bernoulli numbers of the second kind.     

Some combinatorial identities via Fibonacci numbers

The Pascal matrix and the Stirling matrices of the first kind and the second kind obtained from the Fibonacci matrix are studied, respectively. Also, we obtain combinatorial identities from the matrix representation of the Pascal matrix, the Stirling matrices of the first kind and the second kind and the Fibonacci matrix.     

广义m阶Bernoulli数和广义m阶Euler数的计算公式

使用发生函数方法,利用第一类Stirling数和第二类Stirling数分别给出广义m阶Bernoulli数和广义m阶Euler数的计算公式.     

第二类变型Bessel函数的Chebyshev逼近

第二类变型Bessel函数Kn(z)在自变量趋于无穷时就是指数变小的，使用多项式逼近的方法求解往往误差很大．采用指数变换和J．P．Boyd的有理Chebyshev多项式计算第二类变型Bessel函数，得到了令人满意的在较大范围内有效的解．