Results 41 to 50 of about 1,727 (183)
Component graphs of vector spaces and zero-divisor graphs of ordered sets
AKCE International Journal of Graphs and CombinatoricsIn this paper, nonzero component graphs and nonzero component union graphs of finite-dimensional vector spaces are studied using the zero-divisor graph of a specially constructed 0–1-distributive lattice and the zero-divisor graph of rings.
Nilesh Khandekar +2 more
doaj +1 more source
A note on the zero divisor graph of a lattice [PDF]
Transactions on Combinatorics, 2014 Let $L$ be a lattice with the least element $0$. An element $xin L$ is a zero divisor if $xwedge y=0$ for some $yin L^*=Lsetminus left{0right}$. The set of all zero divisors is denoted by $Z(L)$.
T. Tamizh Chelvam , S. Nithya
doaj
Distances in zero-divisor and total graphs from commutative rings–A survey
AKCE International Journal of Graphs and Combinatorics, 2016 There are so many ways to construct graphs from algebraic structures. Most popular constructions are Cayley graphs, commuting graphs and non-commuting graphs from finite groups and zero-divisor graphs and total graphs from commutative rings.
T. Tamizh Chelvam, T. Asir
doaj +1 more source
Ring Classification of Ideal-Based Zero Divisor Graph with Vertices 9
Al-Kitab Journal for Pure SciencesLet R be a finite commutative ring with a non-zero unit, and L be an ideal of R. focuses on expanding the notation of the Zero Divisor Graph to create what is known as the Ideal-Based Zero Divisor Graph. The main goal is to classify rings using the ideal-
Husam Q. Mohammad +2 more
doaj +1 more source
Boxicity of zero divisor graphs
Discrete Applied MathematicsA $d$-dimensional box is the cartesian product $R_i\times\cdots\times R_d$ where each $R_i$ is a closed interval on the real line. The boxicity of a graph, denoted as $box(G)$, is the minimum integer $d\geq 0$ such that $G$ is the intersection graph of a collection of $d$-dimensional boxes.
L. Sunil Chandran, Suraj Kumar Sahoo
openaire +3 more sources
GENERALIZATIONS OF THE ZERO-DIVISOR GRAPH
International Electronic Journal of Algebra, 2020 Summary: Let \(R\) be a commutative ring with \(1\neq 0\) and \(Z(R)\) its set of zerodivisors. The zero-divisor graph of \(R\) is the (simple) graph \(\Gamma \)(R) with vertices \(Z(R) \backslash \{0\}\), and distinct vertices \(x\)and \(y\) are adjacent if and only if \(xy= 0\).
ANDERSON, David F., MCCLURKİN, Grace
openaire +4 more sources
Energy Science &Engineering, EarlyView.SSA‐optimized fuzzy‐PI control reduces battery stress in flywheel–battery hybrid energy storage systems by shifting transient power fluctuations to the flywheel. The strategy decreases ampere‐hour throughput by 46.1% and rainflow damage by 71% while maintaining stable DC‐bus regulation.
ZiFen Han +5 more
wiley +1 more source
On the formal power series algebras generated by a vector space and a linear functional [PDF]
Journal of Hyperstructures, 2017 Let R be a vector space ( on C) and ϕ be an element of R∗ (the dual space of R), the product r · s = ϕ(r)s converts R into an associative algebra that we denote it by Rϕ.
A. R. Khoddami
doaj +1 more source
Catalan Bounds for Symmetric Strength‐Two Orthogonal Arrays
Journal of Combinatorial Designs, EarlyView.ABSTRACT A Hamming shell construction is a two‐level array obtained by taking every binary vector of a given Hamming weight a prescribed number of times, for each weight in turn. Such arrays are invariant under all permutations of the factors, and they are strength‐two orthogonal arrays exactly when the multiplicities satisfy three linear constraints ...
Ruwan C. Karunanayaka
wiley +1 more source
The Zero Divisor Graph of the Ring Z_(2^2 p)
ARO-The Scientific Journal of Koya University, 2016 In this paper, we consider the crossing number and the chromatic number of the zero divisor graph Γ(Z_(2^2 p)) to show that this type of zero divisor graphs is bipartite graph, and the smallest cycle in Γ(Z_(2^2 p)) is of length four this implies that ...
Nazar H. Shuker, Payman A. Rashed
doaj +1 more source