Results 11 to 20 of about 6,290,196 (343)

Simplicial join via tensor product [PDF]

manuscripta mathematica, 2008
Let \(\mathbb k\) be a field, and M and N two finitely generated graded modules over standard graded \(\mathbb k\)-algebras A and B, respectively. We will study generalized, sequentially, almost, and approximately Cohen–Macaulay as well as clean, and pretty clean properties of the \(A\otimes_{\mathbb k} B\)-module \(M\otimes_{\mathbb k} N\) through the
Siamak Yassemi, Massoud Tousi, Hossein Sabzrou   +2 more
semanticscholar   +5 more sources

Homology of products and joins of reflexive relations

Discrete Mathematics, 1975
AbstractThe homology of products and joins of reflexive relations is computed. Rota's homology of the products of two lattices is computed. The homology of finite polyspherical posets is determined by Euler characteristic and length. The category of polyspherical posets is closed under joins and special products but not products.
Frank D. Farmer
openaire   +2 more sources

On the crossing numbers of join products of W_{4}+P_{n} and W_{4}+C_{n} [PDF]

Opuscula Mathematica, 2021
The crossing number \(\mathrm{cr}(G)\) of a graph \(G\) is the minimum number of edge crossings over all drawings of \(G\) in the plane. The main aim of the paper is to give the crossing number of the join product \(W_4+P_n\) and \(W_4+C_n\) for the ...
Michal Staš, Juraj Valiska
doaj   +2 more sources

On the crossing numbers of the join products of five graphs on six vertices with discrete graph

Carpathian Journal of Mathematics, 2022
The crossing number $\mathrm{cr}(G)$ of a graph $G$ is the minimum number of edge crossings over all drawings of $G$ in the plane. In the paper, the crossing number of the join product $G^\ast + D_n$ for the connected graph $G^\ast$ on six vertices ...
Stefan Berezný, M. Staš
semanticscholar   +2 more sources

The Crossing Numbers of Join Products of Paths and Cycles with Four Graphs of Order Five [PDF]

Mathematics, 2021
The main aim of the paper is to establish the crossing numbers of the join products of the paths and the cycles on n vertices with a connected graph on five vertices isomorphic to the graph K1,1,3\e obtained by removing one edge e incident with some ...
Michal Staš
doaj   +2 more sources

The Condition Number of Join Decompositions [PDF]

SIAM Journal on Matrix Analysis and Applications, 2016
The join set of a finite collection of smooth embedded submanifolds of a mutual vector space is defined as their Minkowski sum. Join decompositions generalize some ubiquitous decompositions in multilinear algebra, namely tensor rank, Waring, partially ...
Paul Breiding, N. Vannieuwenhoven
semanticscholar   +3 more sources

Kronecker Products and Local Joins of Graphs [PDF]

Canadian Journal of Mathematics, 1977
When studying the category raph of finite graphs and their morphisms, Ave can exploit the fact that this category has products, [we define these ideas in detail in § 2]. This categorical product of graphs is usually called their Kronecker product, though it has been approached by various authors in various ways and under various names, including tensor
D. A. Waller, M. Farzan
openaire   +4 more sources

On the super edge-magic deficiency of join product and chain graphs

Electronic Journal of Graph Theory and Applications, 2019
A graph G of order ∣V(G)∣ = p and size ∣E(G)∣ = q is called super edge-magic if there exists a bijection f : V(G) ∪ E(G) → {1, 2, 3, ⋯, p + q} such that f(x) + f(xy) + f(y) is a constant for every edge xy ∈ E(G) and f(V(G)) = {1, 2, 3, ⋯, p}. Furthermore,
Anak Agung Gede Ngurah, Rinovia Simanjuntak   +1 more
doaj   +2 more sources

Local Distance Antimagic Chromatic Number of Join Product of Graphs with Cycles or Paths

Hacettepe Journal of Mathematics and Statistics
Let G be a graph of order p without isolated vertices. A bijection f : V → {1, 2, 3, . . . , p} is called a local distance antimagic labeling, if wf (u) ̸= wf (v) for every edge uv of G, where wf(u) =ΣxϵN(u) f(x).
W. Shiu, G. Lau, Nalliah M
semanticscholar   +3 more sources

Analisis Perbandingan Cartesian Product, Cross Join, Inner Join dan Outer Join dalam Si Akad

Techno, 2018
Abstrak - Sistematika merupakan salah satu sistem yang dikembangkan dalam lembaga pendidikan. Manajemen sistem informasi akademik yang kurang baik akan mempengaruhi performa dari sistem informasi akademik. Pemilihan query yang kurang tepat akan. Dalam penelitian ini akan dilakukan.
Fatkhur Rochman, Ahmad Wildan L, Juwari
doaj   +3 more sources