Results 21 to 30 of about 6,290,196 (343)
Exploring the Crossing Numbers of Three Join Products of 6-Vertex Graphs with Discrete Graphs
MathematicsThe significance of searching for edge crossings in graph theory lies inter alia in enhancing the clarity and readability of graph representations, which is essential for various applications such as network visualization, circuit design, and data ...
Michal Staš, Mária Švecová
doaj +2 more sources
Joining element design and product variety in manufacturing industries
Procedia CIRP, 2020 Product variety is a growing trend of offering highly configurable products at the cost of inducing complexity in manufacturing. Joining is a key manufacturing process and historically was a paper-based process with incomplete variety documentation. Nowadays, digital joining element design is a substitution of paper for 3D space.
Marco Wilhelm Groll +2 more
openaire +3 more sources
Sketched Sum-Product Networks for Joins [PDF]
Sketches have shown high accuracy in multi-way join cardinality estimation, a critical problem in cost-based query optimization. Accurately estimating the cardinality of a join operation -- analogous to its computational cost -- allows the optimization of query execution costs in relational database systems.
Tsan, Brian +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
Conjectures about wheels in the join product with cycles
Carpathian Mathematical PublicationsBy the crossing number $\mathrm{cr}(G)$ of a simple graph $G$ we understand the minimum number of edge crossings over all possible drawings of $G$ in the plane.
M. Staš, M. Timková
semanticscholar +2 more sources
Human Joining Peptide: A Proopiomelanocortin Product Secreted as a Homodimer [PDF]
Molecular Endocrinology, 1988 The human (h) POMC gene sequence predicts a 30 amino acid joining peptide (JP) separating the N-terminal fragment [POMC(1-76) or hNT] and ACTH within their common precursor. We used an anti-serum directed against the amidated COOH-terminal end of mouse JP to develop a RIA for the predicted hJP molecule. Immunoreactive JP was detected in tissue extracts
Xavier Bertagna +4 more
openaire +4 more sources
Embeddability of joins and products of polyhedra
Topological Methods in Nonlinear Analysis, 2022 Sergey A. Melikhov
openaire +4 more sources
On join product and local antimagic chromatic number of regular graphs [PDF]
Acta Mathematica Hungarica, 2022 Let $$G = (V,E)$$ G = ( V , E ) be a connected simple graph of order p and size q . A graph G is called local antimagic if G admits a local antimagic labeling.
G. Lau, W. Shiu
semanticscholar +1 more source
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