$n$-Array Jacobson graphs
نویسندگان
چکیده مقاله:
We generalize the notion of Jacobson graphs into $n$-array columns called $n$-array Jacobson graphs and determine their connectivities and diameters. Also, we will study forbidden structures of these graphs and determine when an $n$-array Jacobson graph is planar, outer planar, projective, perfect or domination perfect.
منابع مشابه
Alec Jacobson Teaching Statement
My passion for teaching began early. Throughout high school and college, I tutored English to African immigrants. Later, while student teaching remedial and gifted-and-talented mathematics at a New York City public middle school, I realized the diversity of how students learn. Some students thrive off interactive lectures, while others do not fully digest a lecture until working out examples at...
متن کاملBy Steven Jacobson , Gerald
The HLA D/DR region of the human major histocompatibility complex encodes a family of highly polymorphic, human "Ia-like" molecules that function as genetic restriction elements in a variety of immune phenomena (1, 2). Correlations have been demonstrated between disease susceptibility and particular HLA D/DR antigens (1, 3, 4). Recent evidence (5-7) has demonstrated a considerable heterogeneity...
متن کاملn-Graphs
The use of combinatorial methods in topology is certainly not new; simplicial homology is an obvious example. However the graph theoretic approach to be surveyed here is fairly recent, due to Pezzana, Ferri, Gagliardi, Lins, Mandel, Vince and others. This paper is not intended as a complete review of the subject; for this we refer to [7] where an extended list of references can also be found. I...
متن کاملRelative n-th non-commuting graphs of finite groups
Suppose $n$ is a fixed positive integer. We introduce the relative n-th non-commuting graph $Gamma^{n} _{H,G}$, associated to the non-abelian subgroup $H$ of group $G$. The vertex set is $Gsetminus C^n_{H,G}$ in which $C^n_{H,G} = {xin G : [x,y^{n}]=1 mbox{~and~} [x^{n},y]=1mbox{~for~all~} yin H}$. Moreover, ${x,y}$ is an edge if $x$ or $y$ belong to $H$ and $xy^{n}eq y^{n}x$ or $x...
متن کاملSequentialization for full N-Graphs via sub-N-Graphs
Since proof-nets for MLL− were introduced by Girard (1987), several studies have appeared dealing with its soundness proof. Bellin & Van de Wiele (1995) produced an elegant proof based on properties of subnets (empires and kingdoms) and Robinson (2003) proposed a straightforward generalization of this presentation for proof-nets from sequent calculus for classical logic. In 2014 it was presente...
متن کاملDistributive Lattices of Jacobson Rings
We characterize the distributive lattices of Jacobson rings and prove that if a semiring is a distributive lattice of Jacobson rings, then, up to isomorphism, it is equal to the subdirect product of a distributive lattice and a Jacobson ring. Also, we give a general method to construct distributive lattices of Jacobson rings.
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ذخیره در منابع من قبلا به منابع من ذحیره شده{@ msg_add @}
عنوان ژورنال
دوره 43 شماره 7
صفحات 2137- 2152
تاریخ انتشار 2017-12-30
با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023