Number of minimum vertex cuts in transitive graphs

Let G be a k-regular vertex transitive graph with connectivity κ(G)=k and let m_k(G) be the number of vertex cuts with k vertices. Define m(n,k)=min{m_k(G): GT_n,k}, where T_n,k denotes the set of all k-regular vertex transitive graphs on n vertices with κ(G)=k. In this paper, we determine the exact values of m(n,k).     

Vertex Poisson Algebras Associated with Courant Algebroids

We study relationships between vertex Poisson algebras and Courant algebroids. For any ?-graded vertex Poisson algebra A = ? _n∈? A _(n), we show that A ₍₁₎ is a Courant A ₍₀₎-algebroid. On the other hand, for any Courant 𝒜-algebroid ?, we construct an ?-graded vertex Poisson algebra A = ? _n∈? A _(n) such that A ₍₀₎ is 𝒜 and the Courant 𝒜-algebroid A ₍₁₎ is isomorphic to ? as a Courant 𝒜-algebroid.     

C 2-Cofiniteness of the Vertex Algebra When L is a Nondegenerate Even Lattice

We study the Lie nilpotency and Lie n-Engel properties of symmetric elements under oriented involutions. In some cases, the results obtained are similar to the ones in the case of the classical involution, but interesting new situations arise.     

Total domination changing and stable graphs upon vertex removal

A set S of vertices in a graph G is a total dominating set if every vertex of G is adjacent to some vertex in S. The minimum cardinality of a total dominating set of G is the total domination number of G. A graph is total domination vertex removal stable if the removal of an arbitrary vertex leaves the total domination number unchanged. On the other hand, a graph is total domination vertex removal changing if the removal of an arbitrary vertex changes the total domination number. In this paper, we study total domination vertex removal changing and stable graphs.     

Efficient algorithms for decomposing graphs under degree constraints

Stiebitz [Decomposing graphs under degree constraints, J. Graph Theory 23 (1996) 321-324] proved that if every vertex v in a graph G has degree d(v)?a(v)+b(v)+1 (where a and b are arbitrarily given nonnegative integer-valued functions) then G has a nontrivial vertex partition (A,B) such that d_A(v)?a(v) for every v∈A and d_B(v)?b(v) for every v∈B. Kaneko [On decomposition of triangle-free graphs under degree constraints, J. Graph Theory 27 (1998) 7-9] and Diwan [Decomposing graphs with girth at least five under degree constraints, J. Graph Theory 33 (2000) 237-239] strengthened this result, proving that it suffices to assume d(v)?a+b (a,b?1) or just d(v)?a+b-1 (a,b?2) if G contains no cycles shorter than 4 or 5, respectively.The original proofs contain nonconstructive steps. In this paper we give polynomial-time algorithms that find such partitions. Constructive generalizations for k-partitions are also presented.     

若干图的点强全染色(英文)

对图G及正整数k，映射f：满足：（1）任意e1，e3，如果e1，e2是相邻或相关联的，则有；（2）对u，v，w（G）有，则称f为G的一个k-点强全染色，并且K|G的社点强全染色称为G的点强全色数．本文讨论了一些特殊困的点强全色数，并提出了一个猜想：若G为每一分图的阶数不小于6的图，则（G），其中（G）为本文中定义的一新参数．     

Full field algebras, operads and tensor categories

We study the operadic and categorical formulations of (conformal) full field algebras. In particular, we show that a grading-restricted R×R-graded full field algebra is equivalent to an algebra over a partial operad constructed from spheres with punctures and local coordinates. This result is generalized to conformal full field algebras over VL⊗VR, where VL and VR are two vertex operator algebras satisfying certain finiteness and reductivity conditions. We also study the geometry interpretation of conformal full field algebras over VL⊗VR equipped with a nondegenerate invariant bilinear form. By assuming slightly stronger conditions on VL and VR, we show that a conformal full field algebra over VL⊗VR equipped with a nondegenerate invariant bilinear form exactly corresponds to a commutative Frobenius algebra with a trivial twist in the category of VL⊗VR-modules. The so-called diagonal constructions [Y.-Z. Huang, L. Kong, Full field algebras, arXiv: math.QA/0511328] of conformal full field algebras are given in tensor-categorical language.     

On vertex-coloring edge-weighting of graphs

A k-edge-weighting w of a graph G is an assignment of an integer weight, w(e) ∈ {1,…,k}, to each edge e. An edge-weighting naturally induces a vertex coloring c by defining c(u) = Σ _e∋u w(e) for every u ∈ V (G). A k-edge-weighting of a graph G is vertex-coloring if the induced coloring c is proper, i.e., c(u) ≠ c(v) for any edge uv ∈ E(G). When k ≡ 2 (mod 4) and k ⩾ 6, we prove that if G is k-colorable and 2-connected, δ(G) ⩾ k − 1, then G admits a vertex-coloring k-edge-weighting. We also obtain several sufficient conditions for graphs to be vertex-coloring k-edge-weighting.      

On stars and links of shellable polytopal complexes

The vertex stars of shellable polytopal complexes are shown to be shellable. The link of a vertex v of a shellable polytopal complex is also shown to be shellable, provided that all facets of the star of v are simple polytopes, or (more generally) if there exists a shelling F₁,…,F_n of the star of v such that, for every 1<j?n, the intersection of F_j with the previous facets is an initial segment of a line shelling of the boundary complex of F_j.     

顶点算子超代数及相关的结合代数的表示

设 V 是一个顶点算子超代数. 该文得到了一系列的结合代数A_n(V)(对任何n∈ 1/2 + Z₊(i∈ {0,1})). 也给出了A_n(V) -模但非A_n-1/2(V) -模的不可约模范畴和单的可容许的V -模的范畴之间的一一对应关系. 对于给定的A_n(V) -模但非A_n-1/2(V) -模U, 还构造了一类广义Verma可容许的V -模M_n(U). 进而利用结合代数的表示进一步研究了顶点算子超代数的表示论.     

Balanced decomposition of a vertex-colored graph

A balanced vertex-coloring of a graph G is a function c from V(G) to {−1,0,1} such that ∑{c(v):v∈V(G)}=0. A subset U of V(G) is called a balanced set if U induces a connected subgraph and ∑{c(v):v∈U}=0. A decomposition V(G)=V₁∪?∪V_r is called a balanced decomposition if V_i is a balanced set for 1≤i≤r.In this paper, the balanced decomposition number f(G) of G is introduced; f(G) is the smallest integer s such that for any balanced vertex-coloring c of G, there exists a balanced decomposition V(G)=V₁∪?∪V_r with |V_i|≤s for 1≤i≤r. Balanced decomposition numbers of some basic families of graphs such as complete graphs, trees, complete bipartite graphs, cycles, 2-connected graphs are studied.     

Vertex operator algebras associated to modified regular representations of affine Lie algebras

Let G be a simply-connected complex Lie group with simple Lie algebra g and let be its affine Lie algebra. We use intertwining operators and Knizhnik-Zamolodchikov equations to construct a family of N-graded vertex operator algebras (VOAs) associated to g. These vertex operator algebras contain the algebra of regular functions on G as the conformal weight 0 subspaces and are -modules of dual levels in the sense that , where h^∨ is the dual Coxeter number of g. This family of VOAs was previously studied by Arkhipov-Gaitsgory and Gorbounov-Malikov-Schechtman from different points of view. We show that when k is irrational, the vertex envelope of the vertex algebroid associated to G and the level k is isomorphic to the vertex operator algebra we constructed above. The case of rational levels is also discussed.     

Simplicity of a Vertex Operator Algebra Whose Griess Algebra is the Jordan Algebra of Symmetric Matrices

Let r ∈ ? be a complex number, and d ∈ ?_≥2 a positive integer greater than or equal to 2. Ashihara and Miyamoto [4 Ashihara , T. , Miyamoto , M. ( 2009 ). Deformation of central charges, vertex operator algebras whose Griess algebras are Jordan algebras . Journal of Algebra 32 : 1593 – 1599 . [Google Scholar]] introduced a vertex operator algebra V _𝒥 of central charge dr, whose Griess algebra is isomorphic to the simple Jordan algebra of symmetric matrices of size d. In this article, we prove that the vertex operator algebra V _𝒥 is simple if and only if r is not an integer. Further, in the case that r is an integer (i.e., V _𝒥 is not simple), we give a generator system of the maximal proper ideal I _r of the VOA V _𝒥 explicitly.     

Cubicity, boxicity, and vertex cover

A k-dimensional box is the cartesian product R₁×R₂×?×R_k where each R_i is a closed interval on the real line. The boxicity of a graph G, denoted as box(G), is the minimum integer k such that G is the intersection graph of a collection of k-dimensional boxes. A unit cube in k-dimensional space or a k-cube is defined as the cartesian product R₁×R₂×?×R_k where each R_i is a closed interval on the real line of the form [a_i,a_i+1]. The cubicity of G, denoted as cub(G), is the minimum k such that G is the intersection graph of a collection of k-cubes. In this paper we show that cub(G)≤t+⌈log(n−t)⌉−1 and , where t is the cardinality of a minimum vertex cover of G and n is the number of vertices of G. We also show the tightness of these upper bounds.F.S. Roberts in his pioneering paper on boxicity and cubicity had shown that for a graph G, and , where n is the number of vertices of G, and these bounds are tight. We show that if G is a bipartite graph then and this bound is tight. We also show that if G is a bipartite graph then . We point out that there exist graphs of very high boxicity but with very low chromatic number. For example there exist bipartite (i.e., 2 colorable) graphs with boxicity equal to . Interestingly, if boxicity is very close to , then chromatic number also has to be very high. In particular, we show that if , s≥0, then , where χ(G) is the chromatic number of G.     

On the powers of vertex cover ideals

Let $S=\mathbb{K}[x_1,\dots ,x_n]$ be a polynomial ring, where $\mathbb{K}$ is a field, and G be a simple graph on n vertices. Let $J(G)?S$ be the vertex cover ideal of G. Herzog, Hibi and Ohsugi have conjectured that all powers of vertex cover ideals of chordal graph are componentwise linear. Here we establish the conjecture for the special case of trees. We also show that if G is a unicyclic vertex decomposable graph, then symbolic powers of $J(G)$ are componentwise linear.     

Properties of vertex cover obstructions

We study properties of the sets of minimal forbidden minors for the families of graphs having a vertex cover of size at most k. We denote this set by O(k-VERTEX COVER) and call it the set of obstructions. Our main result is to give a tight vertex bound of O(k-VERTEX COVER), and then confirm a conjecture made by Liu Xiong that there is a unique connected obstruction with maximum number of vertices for k-VERTEX COVER and this graph is C_2k+1. We also find two iterative methods to generate graphs in O((k+1)-VERTEX COVER) from any graph in O(k-VERTEX COVER).