Results 1 to 10 of about 6,290,196 (343)
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š
doaj +3 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 +3 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š
doaj +3 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
doaj +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 +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 +4 more sources
On the strong metric dimension of corona product graphs and join graphs [PDF]
Discrete Applied Mathematics, 2013 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$.
Kuziak, Dorota +2 more
semanticscholar +6 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
+6 more sources
On the Complexity of Inner Product Similarity Join [PDF]
Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2016 A number of tasks in classification, information retrieval, recommendation systems, and record linkage reduce to the core problem of inner product similarity join (IPS join): identifying pairs of vectors in a collection that have a sufficiently large inner product.
Ahle, Thomas D. +3 more
openaire +5 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.
J. Płonka +2 more
openaire +4 more sources