Results 21 to 30 of about 1,017,247 (314)
On bipartite‐mixed graphs [PDF]
Journal of Graph Theory, 2018 AbstractMixed graphs can be seen as digraphs that have both arcs and edges (or digons, that is, two opposite arcs). In this article, we consider the case where such graphs are bipartite. As main results, we show that in this context the Moore‐like bound is attained in the case of diameter , and that bipartite‐mixed graphs of diameter do not exist.
Dalfó Simó, Cristina +2 more
openaire +3 more sources
Concatenating Bipartite Graphs
The Electronic Journal of Combinatorics, 2022 Let $x,y\in (0,1]$, and let $A,B,C$ be disjoint nonempty stable subsets of a graph $G$, where every vertex in $A$ has at least $x|B|$ neighbours in $B$, and every vertex in $B$ has at least $y|C|$ neighbours in $C$, and there are no edges between $A,C$.
Maria Chudnovsky +4 more
openaire +3 more sources
Efficient Bitruss Decomposition for Large-scale Bipartite Graphs [PDF]
IEEE International Conference on Data Engineering, 2020 Cohesive subgraph mining in bipartite graphs becomes a popular research topic recently. An important structure k-bitruss is the maximal cohesive subgraph where each edge is contained in at least k butterflies (i.e., (2,2)-bicliques).
Kai Wang +4 more
semanticscholar +1 more source
On edge product cordial graphs [PDF]
Opuscula Mathematica, 2019 An edge product cordial labeling is a variant of the well-known cordial labeling. In this paper we characterize graphs admitting an edge product cordial labeling.
Jaroslav Ivančo
doaj +1 more source
Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs
Proceedings of the VLDB Endowment, 2021 Bipartite graphs are naturally used to model relationships between two different types of entities, such as people-location, author-paper, and customer-product. When modeling real-world applications like disease outbreaks, edges are often enriched with
Xiaoshuang Chen +5 more
semanticscholar +1 more source
P_4-Colorings and P_4-Bipartite Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2001 A vertex partition of a graph into disjoint subsets V_is is said to be a P_4-free coloring if each color class V_i induces a subgraph without chordless path on four vertices (denoted by P_4).
Chinh T. Hoàng, Van Bang Le
doaj +1 more source
Efficient and Effective Community Search on Large-scale Bipartite Graphs [PDF]
IEEE International Conference on Data Engineering, 2020 Bipartite graphs are widely used to model relation-ships between two types of entities. Community search retrieves densely connected subgraphs containing a query vertex, which has been extensively studied on unipartite graphs.
Kai Wang +5 more
semanticscholar +1 more source
Perfect matchings in inhomogeneous random bipartite graphs in random environment
Cubo, 2022 In this note we study inhomogeneous random bipartite graphs in random environment. These graphs can be thought of as an extension of the classical Erd\H os-R\'enyi random bipartite graphs in a random environment.
Jairo Bochi +2 more
doaj +1 more source
Efficient Exact Algorithms for Maximum Balanced Biclique Search in Bipartite Graphs [PDF]
SIGMOD Conference, 2020 Given a bipartite graph, the maximum balanced biclique (MBB) problem, discovering a mutually connected while disjoint sets of equal size with the maximum cardinality, plays a significant role for mining the bipartite graph and has numerous applications ...
Lu Chen +4 more
semanticscholar +1 more source
Embedding into Bipartite Graphs [PDF]
SIAM Journal on Discrete Mathematics, 2010 The conjecture of Bollobás and Komlós, recently proved by Böttcher, Schacht, and Taraz [Math. Ann. 343(1), 175--205, 2009], implies that for any $γ>0$, every balanced bipartite graph on $2n$ vertices with bounded degree and sublinear bandwidth appears as a subgraph of any $2n$-vertex graph $G$ with minimum degree $(1+γ)n$, provided that $n$ is ...
Julia Böttcher +2 more
openaire +2 more sources