Results 31 to 40 of about 6,290,196 (343)
The crossing numbers of join products of eight graphs of order six with paths and cycles
Karpatsʹkì Matematičnì Publìkacìï, 2023 The crossing number $\mathrm{cr}(G)$ of a graph $G$ is the minimum number of edge crossings over all drawings of $G$ in the plane. The main aim of this paper is to give the crossing numbers of the join products of eight graphs on six vertices with paths ...
M. Staš
doaj +1 more source
Spectral radius of the Harary matrix of the join product of regular graphs1
Journal of Physics: Conference Series, 2021 The distance between two vertices is equal to the number of edges on the shortest path connecting them. The Harary matrix of a simple, undirected, connected and unweighted graph of n vertices is an nonnegative matrix of order n, such that the (i, j ...
Luis Medina, Macarena Trigo
semanticscholar +1 more source
The crossing numbers of join products of four graphs of order five with paths and cycles [PDF]
Opuscula Mathematica, 2023 The crossing number \(\mathrm{cr}(G)\) of a graph \(G\) is the minimum number of edge crossings over all drawings of \(G\) in the plane. In the paper, we extend known results concerning crossing numbers of join products of four small graphs with paths ...
Michal Staš, Mária Timková
doaj +1 more source
Super edge-magic deficiency of join-product graphs [PDF]
, 2014 A graph $G$ is called \textit{super edge-magic} if there exists a bijective function $f$ from $V(G) \cup E(G)$ to $\{1, 2, \ldots, |V(G) \cup E(G)|\}$ such that $f(V(G)) = \{1, 2, \ldots, |V(G)|\}$ and $f(x) + f(xy) + f(y)$ is a constant $k$ for every ...
Anak Agung Gede Ngurah +1 more
openalex +4 more sources
Approximate Top-k Inner Product Join with a Proximity Graph
2021 IEEE International Conference on Big Data (Big Data), 2021 This paper addresses the problem of top-k inner product join, which, given two sets of high-dimensional vectors and a result size k, outputs k pairs of vectors that have the largest inner product.
Hayato Nakama +2 more
semanticscholar +1 more source
The Crossing Number of Cartesian Product of 5-Wheel with any Tree
Discussiones Mathematicae Graph Theory, 2021 In this paper, we establish the crossing number of join product of 5-wheel with n isolated vertices. In addition, the exact values for the crossing numbers of Cartesian products of the wheels of order at most five with any tree T are given.
Wang Yuxi, Huang Yuanqiu
doaj +1 more source
ALTERNATIVE PROOF ON THE CROSSING NUMBER OF K1,1,3,N [PDF]
Acta Electrotechnica et Informatica, 2019 The main aim of the paper is to give the crossing number of join product G+Dn for the connected graph G of order five isomorphic with the complete tripartite graph K1,1,3, where Dn consists on n isolated vertices.
Michal STAS
doaj +1 more source
The majority coloring of the join and Cartesian product of some digraph [PDF]
MATEC Web of Conferences, 2022 A majority coloring of a digraph is a vertex coloring such that for every vertex, the number of vertices with the same color in the out-neighborhood does not exceed half of its out-degree.
Shi Mei +3 more
doaj +1 more source
Dehydrogenative Syntheses of Biazoles via a “Pre-Join” Approach
JACS Au, 2023 The structural motif of biazoles is the predominant substructure of many natural products, pharmaceuticals, and organic materials. Considerable efforts have focused on synthesizing these compounds; however, a limited number of processes have been ...
Tian‐Yang Yu +7 more
semanticscholar +1 more source
When Product Markets Become Collective Traps: The Case of Social Media
Social Science Research Network, 2023 In many contexts, the individual value from consuming a product or service increases as more people consume it. The more of your peers who join TikTok, for example, the more value you probably see in joining yourself.
Leonardo Bursztyn +3 more
semanticscholar +1 more source