Results 31 to 40 of about 1,011,259 (278)
European Journal of Combinatorics, 1996 Graphs that are obtained from single edges and even cycles by successive amalgamations are called cellular graphs. Especially cellular bipartite graphs are investigated in this paper. Since graphs with their shortest-path metrics are particular instances of finite metric spaces, these investigations are done from a metric point of view.
Bandelt, Hans-Jürgen, Chepoi, Victor
openaire +1 more source
The step Sidorenko property and non-norming edge-transitive graphs [PDF]
, 2019 Sidorenko's Conjecture asserts that every bipartite graph H has the Sidorenko property, i.e., a quasirandom graph minimizes the density of H among all graphs with the same edge density.
Král', Daniel +3 more
core +2 more sources
Bipartite graph capsule network
World wide web (Bussum), 2022 Graphs have been widely adopted in various fields, where many graph models are developed. Most of previous research focuses on unipartite or homogeneous graph analysis.
Xianhang Zhang +5 more
semanticscholar +1 more source
Neural Graph Collaborative Filtering [PDF]
Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 2019 Learning vector representations (aka. embeddings) of users and items lies at the core of modern recommender systems. Ranging from early matrix factorization to recently emerged deep learning based methods, existing efforts typically obtain a user's (or ...
Xiang Wang +4 more
semanticscholar +1 more source
Rainbow perfect matchings in r-partite graph structures [PDF]
, 2016 A matching M in an edge–colored (hyper)graph is rainbow if each pair of edges in M have distinct colors. We extend the result of Erdos and Spencer on the existence of rainbow perfect matchings in the complete bipartite graph Kn,n to complete bipartite ...
Cano Vila, María del Pilar +2 more
core +2 more sources
Embedding into Bipartite Graphs [PDF]
SIAM Journal on Discrete Mathematics, 2010 16 pages, 2 ...
Böttcher, Julia +2 more
openaire +2 more sources
Non-Bipartite K-Common Graphs [PDF]
Combinatorica, 2022 A graph H is k-common if the number of monochromatic copies of H in a k-edge-coloring of K_n is asymptotically minimized by a random coloring. For every k, we construct a connected non-bipartite k-common graph. This resolves a problem raised by Jagger, Stovicek and Thomason [Combinatorica 16 (1996), 123-141]. We also show that a graph H is k-common for
Králʼ, Daniel +4 more
openaire +4 more sources
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2019 Matching is a part of graph theory that discusses pair. A matching M is called to be maximum if M has the highest number of elements. A blossom which is encountered in non-bipartite graph can cause failure in process of finding the maximum matching in ...
Muchammad Abrori, Mohammad Imam Jauhari
doaj +1 more source
IEEE Access, 2019 Community detection has become a hot topic in complex networks. It plays an important role in information recommendation and public opinion control. Bipartite network, as a special complex network, reflects the characteristics of a kind of network in our
Furong Chang +4 more
doaj +1 more source
Journal of Function Spaces, 2022 Graph theory is considered an attractive field for finding the proof techniques in discrete mathematics. The results of graph theory have applications in many areas of social, computing, and natural sciences.
A. El-Mesady +2 more
doaj +1 more source