查看更多>>摘要：A signed graph G=(G,σ)is a graph G=(V(G),E(G))with vertex set V(G)and edge set E(G),together with a function σ:E → {+1,-1} assigning a positive or negative sign to each edge.In this paper,we present a more elementary proof for the matrix-tree theorem of signed graphs,which is based on the relations between the incidence matrices and the Laplcians of signed graphs.As an application,we also obtain the results of Monfared and Mallik about the matrix-tree theorem of graphs for signless Laplacians.
Zhaobing FanShaolong HanSeok-Jin KangYoung Rock Kim...
503-540页
查看更多>>摘要：Using new combinatorics of Young walls,we give a new construction of the arbitrary level highest weight crystal B(λ)for the quantum affine algebras of types A(22n),D(2)n+1,A(2)2n-1,D(1)n,B(1)n and C(1)n.We show that the crystal consisting of reduced Young walls is isomorphic to the crystal B(λ).Moreover,we provide a new realization of the crystal B(∞o)in terms of reduced virtual Young walls and reduced extended Young walls.
NETL
NSTL
万方数据
维普