Results 1 to 10 of about 855,414 (324)
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 +4 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.
Victor Kyritsis +3 more
core +4 more sources
On the crossing number of join product of the discrete graph with special graphs of order five [PDF]
Electronic Journal of Graph Theory and Applications, 2020 The main aim of the paper is to give the crossing number of join product G+Dn for the disconnected graph G of order five consisting of the complete graph K4 and of one isolated vertex.
Michal Staš
doaj +2 more sources
The crossing numbers of join products of four graphs of order five with paths and cycles [PDF]
Opuscula Mathematica, 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. In the paper, we extend known results concerning crossing numbers of join products of four small graphs with paths ...
Michal Staš, Mária Timková
doaj +2 more sources
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
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 +2 more sources
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 +3 more sources
Joins and Direct Products of Equational Classes [PDF]
Canadian Mathematical Bulletin, 1969 Let K0 and K1 be equational classes of algebras of the same type. The smallest equational class K containing K0 and K1 is the join of K0 and K1; in notation, K = K0 ∨ K1. The direct product K0 × K1 is the class of all algebras α which are isomorphic to an algebra of the form a0 × a1, a0 ∈ K1.
George Grätzer, H. Lakser, J. Płonka
openalex +3 more sources
Molecules, 2018 The Cartesian product and join are two classical operations in graphs. Let dL(G)(e) be the degree of a vertex e in line graph L(G) of a graph G. The edge versions of atom-bond connectivity (ABCe) and geometric arithmetic (GAe) indices of G are defined as
Xiujun Zhang, Huiqin Jiang, Jia-Bao Liu
exaly +3 more sources