نتایج جستجو برای: reflexive graphs

تعداد نتایج: 104017  

Journal: :Journal of Algebra 1968

Journal: :Proceedings of the American Mathematical Society 1965

2010
Dongsheng Zhao

In this paper we study the reflexive subobject lattices and reflexive endomorphism algebras in a concrete category. For the category Set of sets and mappings, a complete characterization for both reflexive subobject lattices and reflexive endomorphism algebras is obtained. Some partial results are also proved for the category of abelian groups.

Journal: :J. Applied Mathematics 2013
Ning Li Qing-Wen Wang Jing Jiang

We propose an iterative algorithm for solving the reflexive solution of the quaternion matrix equation AXB + CXHD = F. When the matrix equation is consistent over reflexive matrix X, a reflexive solution can be obtained within finite iteration steps in the absence of roundoff errors. By the proposed iterative algorithm, the least Frobenius norm reflexive solution of the matrix equation can be d...

2011
ALEXANDER M. KASPRZYK BENJAMIN NILL

We introduce reflexive polytopes of index l as a natural generalisation of the notion of a reflexive polytope of index 1. These l-reflexive polytopes also appear as dual pairs. In dimension two we show that they arise from reflexive polygons via a change of the underlying lattice. This allows us to efficiently classify all isomorphism classes of l-reflexive polygons up to index 200. As another ...

2004
Stephen Grimes

The present study examines the uses of the reflexive marker in Lusaamia, a Bantu language of Kenya. In addition to being a true reflexive, the reflexive verbal prefix is also used in indirect reflexive constructions, as a middle voice / stative marker, and also to indicate when an action is being done for no particular purpose (when used in conjunction with a causative marker). I show that unac...

Journal: :transactions on combinatorics 2016
chandrashekar adiga b‎. ‎r‎. ‎rakshith

‎in this paper we introduce mixed unitary cayley graph $m_{n}$‎ ‎$(n>1)$ and compute its eigenvalues‎. ‎we also compute the energy of‎ ‎$m_{n}$ for some $n$‎.

Journal: :CoRR 2017
Stefan Bard Thomas Bellitto Christopher Duffy Gary MacGillivray Feiran Yang

Given two graphs G = (VG, EG) and H = (VH , EH), a homomorphism from G to H is a function f : VG → VH such that for every uv ∈ EG, f(u)f(v) ∈ EH . A homomorphism from G to H is referred to as an H-colouring of G and the vertices of H are regarded as colours. The graph H is called the target of the homomorphism. These definitions extend to directed graphs by requiring that the mapping must prese...

Journal: :Theor. Comput. Sci. 2001
Sergei L. Bezrukov Robert Elsässer

We consider an edge-isoperimetric problem (EIP) on the cartesian powers of graphs. One of our objectives is to extend the list of graphs for whose cartesian powers the lexicographic order provides nested solutions for the EIP. We present several new classes of such graphs that include as special cases all presently known graphs with this property. Our new results are applied to derive best poss...

2006
N. J. KALTON

Answering an old problem in nonlinear theory, we show that c0 cannot be coarsely or uniformly embedded into a reflexive Banach space, but that any stable metric space can be coarsely and uniformly embedded into a reflexive space. We also show that certain quasi-reflexive spaces (such as the James space) also cannot be coarsely embedded into a reflexive space and that the unit ball of these spac...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید