Results 11 to 20 of about 803,824 (319)
Super edge-magic deficiency of join-product graphs [PDF]
, 2014 11 ...
Anak Agung Gede Ngurah +1 more
core +5 more sources
Simplicial join via tensor product [PDF]
manuscripta mathematica, 2008 Let \(\mathbb k\) be a field, and M and N two finitely generated graded modules over standard graded \(\mathbb k\)-algebras A and B, respectively. We will study generalized, sequentially, almost, and approximately Cohen–Macaulay as well as clean, and pretty clean properties of the \(A\otimes_{\mathbb k} B\)-module \(M\otimes_{\mathbb k} N\) through the
Siamak Yassemi +2 more
openaire +4 more sources
Non-inclusive and inclusive distance irregularity strength for the join product of graphs [PDF]
Electronic Journal of Graph Theory and Applications, 2022 A function ϕ: V(G)→{1, 2, …, k} of a simple graph G is said to be a non-inclusive distance vertex irregular k-labeling of G if the sums of labels of vertices in the open neighborhood of every vertex are distinct and is said to be an inclusive distance ...
Faisal Susanto +3 more
openalex +3 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.
Derk Hendrik Dominick Eggink +1 more
openalex +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
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
openalex +4 more sources
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á
openalex +3 more sources
Embeddability of joins and products of polyhedra
Topological Methods in Nonlinear Analysis, 2022 Sergey A. Melikhov
openalex +4 more sources
On the strong metric dimension of corona product graphs and join graphs [PDF]
Discrete Applied Mathematics, 2012 Let $G$ be a connected graph. A vertex $w$ strongly resolves a pair $u$, $v$ of vertices of $G$ if there exists some shortest $u-w$ path containing $v$ or some shortest $v-w$ path containing $u$. A set $W$ of vertices is a strong resolving set for $G$ if every pair of vertices of $G$ is strongly resolved by some vertex of $W$.
Dorota Kuziak +2 more
openalex +5 more sources
The Cartesian Product and Join Graphs on Edge-Version Atom-Bond Connectivity and Geometric Arithmetic Indices [PDF]
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 +3 more
openalex +3 more sources