Results 31 to 40 of about 720,784 (299)
Regular packings of regular graphs
Discrete Mathematics, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Amauri Gutiérrez, Anna S. Lladó
openaire +2 more sources
Artist Similarity for Everyone: A Graph Neural Network Approach
Transactions of the International Society for Music Information Retrieval, 2022 Artist similarity plays an important role in organizing, understanding, and subsequently, facilitating discovery in large collections of music. In this paper, we present a hybrid approach to computing similarity between artists using graph neural ...
Filip Korzeniowski +2 more
doaj +1 more source
Regular Partitions of Regular Graphs [PDF]
Canadian Mathematical Bulletin, 1978 In the study of the combinatorial structure of edge-graphs of convex polytopes one may ask whether a given graph possesses a partition consisting of certain kinds of subgraphs.In this paper we describe some special partitions of 3-valent and 4-valent graphs.
openaire +2 more sources
Independent Distribution Regularization for Private Graph Embedding [PDF]
, 2023 Learning graph embeddings is a crucial task in graph mining tasks. An effective graph embedding model can learn low-dimensional representations from graph-structured data for data publishing benefiting various downstream applications such as node ...
Song, Yangqiu, Hu, Qi
core +1 more source
On extension of regular graphs [PDF]
Journal of Discrete Mathematical Sciences and Cryptography, 2018 arXiv admin note: substantial text overlap with arXiv:1407 ...
Banerjee, Anirban, Bej, Saptarshi
openaire +2 more sources
Ars Mathematica Contemporanea, 2019 20 pages, 6 ...
Primoz Potocnik, Janos Vidali
openaire +6 more sources
The American Mathematical Monthly, 2011 A graph G=(V,E) is called a unit-distance graph in the plane if there is an injective embedding of V in the plane such that every pair of adjacent vertices are at unit distance apart. If additionally the corresponding edges are non-crossing and all vertices have the same degree r we talk of a regular matchstick graph.
Sascha Kurz, Rom Pinchasi
openaire +3 more sources
Nim-Regularity of Graphs [PDF]
The Electronic Journal of Combinatorics, 1999 Ehrenborg and Steingrímsson defined simplicial Nim, and defined Nim-regular complexes to be simplicial complexes for which simplicial Nim has a particular type of winning strategy. We completely characterize the Nim-regular graphs by the exclusion of two vertex-induced subgraphs, the graph on three vertices with one edge and the graph on five ...
openaire +2 more sources
Mathematics, 2023 NONNEGATIVE matrix factorization (NMF) is an effective technique for dimensionality reduction of high-dimensional data for tasks such as machine learning and data visualization.
Jie Li, Yaotang Li, Chaoqian Li
doaj +1 more source
Journal of Combinatorial Theory, Series B, 1997 A covering projection from a graph \(G\) onto a graph \(H\) is a ``local isomorphism'': a mapping from the vertex set of \(G\) onto the vertex set of \(H\) such that, for every \(v\in V(G)\), the neighborhood of \(v\) is mapped bijectively onto the neighborhood (in \(H\)) of the image of \(v\).
Jan Kratochvíl +2 more
openaire +1 more source