Class of Crosscap Two Graphs Arising from Lattices–I
نویسندگان
چکیده
Let L be a lattice. The annihilating-ideal graph of is simple whose vertex set the all nontrivial ideals and two distinct vertices I J are adjacent if only I∧J=0. In this paper, crosscap graphs lattices with at most four atoms characterized. These characterizations provide classes multipartite graphs, which embedded in Klein bottle.
منابع مشابه
The Class of Random Graphs Arising from Exchangeable Random Measures
We introduce a class of random graphs that we argue meets many of the desiderata one would demand of a model to serve as the foundation for a statistical analysis of real-world networks. The class of random graphs is defined by a probabilistic symmetry: invariance of the distribution of each graph to an arbitrary relabelings of its vertices. In particular, following Caron and Fox, we interpret ...
متن کاملA Family of 2-graphs Arising from Two-dimensional Subshifts
Higher-rank graphs (or k-graphs) were introduced by Kumjian and Pask to provide combinatorial models for the higher-rank Cuntz-KriegerC∗-algebras of Robertson and Steger. Here we consider a family of finite 2-graphs whose path spaces are dynamical systems of algebraic origin, as studied by Schmidt and others. We analyse the C∗-algebras of these 2-graphs, find criteria under which they are simpl...
متن کاملCrosscap Numbers of Two-component Links
We define the crosscap number of a 2-component link as the minimum of the first Betti numbers of connected, nonorientable surfaces bounding the link. We discuss some properties of the crosscap numbers of 2-component links.
متن کاملOn Involutions Arising from Graphs
We investigate various aspects of involutions of groups, i.e, anti-automorphisms of order at most two. The emphasis is on finite abelian groups. We count the number of involutions for the cyclic groups, and consider the problem for direct products of groups. We also give a characterization for the set of skewed squares of finitely generated abelian groups with identity as the involution. The pr...
متن کاملQuantum discord of states arising from graphs
Quantum discord refers to an important aspect of quantum correlations for bipartite quantum systems. In our earlier works we have shown that corresponding to every graph (combinatorial) there are quantum states whose properties are reflected in the structure of the corresponding graph. Here, we attempt to develop a graph theoretic study of quantum discord that corresponds to a necessary and suf...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2023
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math11061553