Results 1 to 10 of about 858,294 (165)
Simplicial join via tensor product [PDF]
manuscripta mathematica, 2008 Let \(k\) be a field, \(A\) and \(B\) finitely generated (standard graded) \(k\)-algebras, and \(M\) and \(N\) finitely generated (graded) modules over \(A\) and \(B\) respectively. In this paper, the authors prove several results of the following type, or its variances: ``\(M \bigotimes_k N\) is \({\mathcal P}\) as a \(A\bigotimes_k B\)-module if (or,
Sabzrou, Hossein +2 more
openaire +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
Mathematics, 2020 The crossing number cr ( G ) of a graph G is the minimum number of edge crossings over all drawings of G in the plane. The main goal of the paper is to state the crossing number of the join product K 2 , 3 + C n for the complete ...
Michal Staš
doaj +2 more sources
A New Framework for Join Product Skew [PDF]
, 2012 Different types of data skew can result in load imbalance in the context of parallel joins under the shared nothing architecture. We study one important type of skew, join product skew (JPS). A static approach based on frequency classes is proposed which takes for granted the data distribution of join attribute values.
Afrati, Foto +3 more
openaire +3 more sources
Super edge-magic labeling of graphs: deficiency and maximality [PDF]
Electronic Journal of Graph Theory and Applications, 2017 A graph G of order p and size q is called super edge-magic if there exists a bijective function f from V(G) U E(G) to {1, 2, 3, ..., p+q} such that f(x) + f(xy) + f(y) is a constant for every edge $xy \in E(G)$ and f(V(G)) = {1, 2, 3, ..., p}.
Anak Agung Gede Ngurah +1 more
doaj +3 more sources
The crossing numbers of join products of paths with three graphs of order five [PDF]
Opuscula Mathematica, 2022 The main aim of this paper is to give the crossing number of the join product \(G^\ast+P_n\) for the disconnected graph \(G^\ast\) of order five consisting of the complete graph \(K_4\) and one isolated vertex, where \(P_n\) is the path on \(n\) vertices.
Michal Staš, Mária Švecová
doaj +1 more source
Every graph is local antimagic total and its applications [PDF]
Opuscula Mathematica, 2023 Let \(G = (V,E)\) be a simple graph of order \(p\) and size \(q\). A graph \(G\) is called local antimagic (total) if \(G\) admits a local antimagic (total) labeling. A bijection \(g : E \to \{1,2,\ldots,q\}\) is called a local antimagic labeling of \(G\)
Gee-Choon Lau +2 more
doaj +1 more source
On the crossing numbers of join products of five graphs of order six with the discrete graph [PDF]
Opuscula Mathematica, 2020 The main purpose of this article is broaden known results concerning crossing numbers for join of graphs of order six. We give the crossing number of the join product \(G^{\ast} + D_n\), where the disconnected graph \(G^{\ast}\) of order six consists of ...
Michal Staš
doaj +1 more source
The crossing numbers of join products of eight graphs of order six with paths and cycles
Karpatsʹkì Matematičnì Publìkacìï, 2023 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 this paper is to give the crossing numbers of the join products of eight graphs on six vertices with paths ...
M. Staš
doaj +1 more source
Crossing Numbers of Join Product with Discrete Graphs: A Study on 6-Vertex Graphs
Mathematics, 2023 Reducing the number of crossings on graph edges can be useful in various applications, including network visualization, circuit design, graph theory, cartography or social choice theory.
Jana Fortes, Michal Staš
doaj +1 more source