Results 21 to 30 of about 46,607 (299)
Cyclic Permutations in Determining Crossing Numbers
Discussiones Mathematicae Graph Theory, 2022 The crossing number of a graph G is the minimum number of edge crossings over all drawings of G in the plane. Recently, the crossing numbers of join products of two graphs have been studied.
Klešč Marián, Staš Michal
doaj +1 more source
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
openaire +2 more sources
Data-driven through-life costing to support product lifecycle management solutions in innovative product development [PDF]
, 2011 Innovative product usually refers to product that comprises of creativity and new ideas. In the development of such a new product, there is often a lack of historical knowledge and data available to be used to perform cost estimation accurately.
John D. Lanham +9 more
core +1 more source
Communication-Efficient Inner Product Private Join and Compute with Cardinality [PDF]
, 2023 Private join and compute (PJC) is a paradigm where two parties owing their private database securely join their databases and compute a function over the combined database. Inner product PJC, introduced by Lepoint et al.
Koji Chida +4 more
core
The Crossing Numbers of Join Products of Paths and Cycles with Four Graphs of Order Five
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 +1 more source
On Join Graph Of Zero-Divisor Graphs Of Direct Product Of Finite Fields [PDF]
, 2023 I. Beck introduced the concept of Zero-divisor graph of a commutative ring R with all the elements of ring R as vertices and two distinct vertices x, y are adjacent if and only if x · y = 0.
Subhash Mallinath Gaded +1 more
core +1 more source
On the Crossing Numbers of Cartesian Products of Wheels and Trees
Discussiones Mathematicae Graph Theory, 2017 Bokal developed an innovative method for finding the crossing numbers of Cartesian product of two arbitrarily large graphs. In this article, the crossing number of the join product of stars and cycles are given.
Klešč Marián +2 more
doaj +1 more source
Parity Properties of Configurations
Mathematics, 2022 In the paper, the crossing number of the join product G*+Dn for the disconnected graph G* consisting of two components isomorphic to K2 and K3 is given, where Dn consists of n isolated vertices.
Michal Staš
doaj +1 more source
Inequalities for cd -Indices of Joins and Products of Polytopes [PDF]
Combinatorica, 2003 The cd-index is a polynomial which encodes the flag f-vector of a convex polytope. For polytopes U and V, we determine explicit recurrences for computing the cd-index of the free join $$U\textcircled{v}V$$ and the cd-index of the Cartesian product U x V.
Richard Ehrenborg, Harold Fox
openaire +1 more source
On the Crossing Numbers of Cartesian Products of Stars and Graphs of Order Six
Discussiones Mathematicae Graph Theory, 2013 The crossing number cr(G) of a graph G is the minimal number of crossings over all drawings of G in the plane. According to their special structure, the class of Cartesian products of two graphs is one of few graph classes for which some exact values of ...
Klešč Marián, Schrötter Štefan
doaj +1 more source