Results 1 to 10 of about 803,824 (319)
Crossing Numbers of Join Product with Discrete Graphs: A Study on 6-Vertex Graphs [PDF]
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š
openalex +3 more sources
Join-irreducible cross product varieties of groups [PDF]
Transactions of the American Mathematical Society, 1974 Let U, !8 be varieties of groups which have finite coprime exponents, let U be metabelian and nilpotent with "small" nilpotency class, and let !8 be abelian. The product variety U!8 is shown to be join-irreducible if and only if U is join-irreducible. This is done by obtaining a simple description for the critical groups generating U!8 when U is join ...
James J. Woeppel
+5 more sources
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š
openalex +2 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
openalex +2 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š
openalex +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
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š
openalex +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
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
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
M. Farzan, Derek A. Waller
openalex +3 more sources