Results 1 to 10 of about 4,550,446 (348)
iRun: Horizontal and Vertical Shape of a Region-Based Graph Compression
Italian National Conference on Sensors, 2022 Graph data are pervasive worldwide, e.g., social networks, citation networks, and web graphs. A real-world graph can be huge and requires heavy computational and storage resources for processing.
Muhammad Umair, Young-Koo Lee
semanticscholar +1 more source
On (a,d)-antimagic labelings of Hn, FLn and mCn
Indonesian Journal of Combinatorics, 2020 In this paper, we derive the necessary condition for an (a,d )- antimagic labeling of some new classes of graphs such as Hn, F Ln and mCn. We prove that Hn is (7n +2, 1)-antimagic and mCn is ((mn+3)/2,1)- antimagic.
Ramalakshmi Rajendran, K. M. Kathiresan
doaj +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
KGAT: Knowledge Graph Attention Network for Recommendation [PDF]
Knowledge Discovery and Data Mining, 2019 To provide more accurate, diverse, and explainable recommendation, it is compulsory to go beyond modeling user-item interactions and take side information into account.
Xiang Wang +4 more
semanticscholar +1 more source
On Rainbow Antimagic Coloring of Joint Product of Graphs
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2023 Let be a connected graph with vertex set and edge set . A bijection from to the set is a labeling of graph . The bijection is called rainbow antimagic vertex labeling if for any two edge and in path , where and .
Brian Juned Septory +3 more
doaj +1 more source
Unavoidable induced subgraphs in large graphs with no homogeneous sets [PDF]
, 2015 A homogeneous set of an $n$-vertex graph is a set $X$ of vertices ($2\le |X|\le n-1$) such that every vertex not in $X$ is either complete or anticomplete to $X$. A graph is called prime if it has no homogeneous set.
Diestel +12 more
core +1 more source
Prevention and Control of Fusarium spp., the Causal Agents of Onion (Allium cepa) Basal Rot
Horticulturae, 2022 Fusarium basal rot disease (FBR) is considered a serious threat to commercial onion production in Israel and worldwide. Today, coping means applied in Israel against the disease have limited efficiency and include a four-year crop cycle and disinfecting ...
Ofir Degani +4 more
doaj +1 more source
Learning Entity and Relation Embeddings for Knowledge Graph Completion
AAAI Conference on Artificial Intelligence, 2015 Knowledge graph completion aims to perform link prediction between entities. In this paper, we consider the approach of knowledge graph embeddings.
Yankai Lin +4 more
semanticscholar +1 more source
Spectral Graph Forge: Graph Generation Targeting Modularity
, 2018 Community structure is an important property that captures inhomogeneities common in large networks, and modularity is one of the most widely used metrics for such community structure.
Baldesi, Luca +2 more
core +1 more source
An Inclusive Distance Irregularity Strength of n-ary Tree
JTAM (Jurnal Teori dan Aplikasi Matematika)An inclusive distance vertex irregular labelling of a simple graph G is a function of the vertex set of to positive integer set such that the sum of its vertex label and the labels of all vertices adjacent to the vertex are distinct.
Kristiana Wijaya +3 more
doaj +1 more source