A graph Γ is said to be G-semisymmetric if it is regular and there exists a subgroup G of A := Aut(Γ) acting transitively on its edge set but not on its vertex set. In the case of G = A, we call Γ a semisymmetric g...A graph Γ is said to be G-semisymmetric if it is regular and there exists a subgroup G of A := Aut(Γ) acting transitively on its edge set but not on its vertex set. In the case of G = A, we call Γ a semisymmetric graph. The aim of this paper is to investigate (G-)semisymmetric graphs of prime degree. We give a group-theoretical construction of such graphs, and give a classification of semisymmetric cubic graphs of order 6p2 for an odd prime p.展开更多
Let D be a triplane, i.e., a 2-(ν, k, 3) symmetric design, and G be a subgroup of the full automorphism group of D. In this paper we prove that if G is flag-transitive point-primitive, then the socle of G cannot be a...Let D be a triplane, i.e., a 2-(ν, k, 3) symmetric design, and G be a subgroup of the full automorphism group of D. In this paper we prove that if G is flag-transitive point-primitive, then the socle of G cannot be a sporadic simple group.展开更多
It is shown that in Lagrangian numerical differentiation formulas, the coefficients are explicitly expressed by means of cycle indicator polynomials of symmetric group. Moreover, asymptotic expansions of the remainder...It is shown that in Lagrangian numerical differentiation formulas, the coefficients are explicitly expressed by means of cycle indicator polynomials of symmetric group. Moreover, asymptotic expansions of the remainders are also explicitly represented as a fixed number of interpolation nodes approaching infinitely to the point at which the derivative is evaluated. This implies that complete explicit formulas for local Lagrangian numerical differentiation can be obtained.展开更多
基金This work was supported partly by the National Natural Science Foundation of China(Grant Nos.19831050,10171006)the Doctoral Program Foundation of Institutions of Higher Education of China(Grant No.2000000102).
文摘A graph Γ is said to be G-semisymmetric if it is regular and there exists a subgroup G of A := Aut(Γ) acting transitively on its edge set but not on its vertex set. In the case of G = A, we call Γ a semisymmetric graph. The aim of this paper is to investigate (G-)semisymmetric graphs of prime degree. We give a group-theoretical construction of such graphs, and give a classification of semisymmetric cubic graphs of order 6p2 for an odd prime p.
基金supported by Scientific Research Foundation for the Returned Overseas Scholars, Ministry of Education of China
文摘Let D be a triplane, i.e., a 2-(ν, k, 3) symmetric design, and G be a subgroup of the full automorphism group of D. In this paper we prove that if G is flag-transitive point-primitive, then the socle of G cannot be a sporadic simple group.
基金supported in part by the National Natural Science Foundation of China(Grant No.10471128)
文摘It is shown that in Lagrangian numerical differentiation formulas, the coefficients are explicitly expressed by means of cycle indicator polynomials of symmetric group. Moreover, asymptotic expansions of the remainders are also explicitly represented as a fixed number of interpolation nodes approaching infinitely to the point at which the derivative is evaluated. This implies that complete explicit formulas for local Lagrangian numerical differentiation can be obtained.
基金国家自然科学基金(No.10871021No.10871032)+3 种基金"Agencija za raziskovalno dejavnost Republike Slovenije"proj.mladi raziskovalci"Agencija za raziskovalno dejevnost Republike Slovenije".research program P1-0285高等学校博士学科点专项科研基金(No.20060285002)资助的项目.
