Results 11 to 20 of about 1,017,247 (314)
Packing bipartite graphs with covers of complete bipartite graphs [PDF]
Discrete Applied Mathematics, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chalopin, Jérémie, Paulusma, Daniël
core +10 more sources
Bipartite-Perfect Graphs [PDF]
Electronic Notes in Discrete Mathematics, 1999 Two graphs \(G\) and \(H\) on the vertex set \(V\) are \(P_4\)-isomorphic if there is a permutation \(\pi\) on \(V\) such that, for all subsets \(S\) of \(V\), \(S\) induces a chordless \(P_4\) in \(G\) if and only if \(\pi (S)\) induces a \(P_4\) in \(H\). The author characterizes all graphs \(P_4\)-isomorphic to a bipartite graph. For example, we can
Van Bang Le, Bang Le, Van
openaire +2 more sources
Star Bicolouring of Bipartite Graphs [PDF]
AlgorithmsWe give an integer linear program formulation for the star bicolouring of bipartite graphs. We develop a column generation method to solve the linear programming relaxation to obtain a lower bound for the minimum number of colours needed.
Daya Gaur +2 more
doaj +2 more sources
Bipartite bithreshold graphs [PDF]
Discrete Mathematics, 1993 This paper deals with bithreshold graphs and their characterization. After having given some necessary properties the authors succeed in proving a complete characterization of the class of bipartite bithreshold graphs by means of 11 not bithreshold (so-called forbidden induced subgraphs) and 5 classes of induced subgraphs.
Peter L. Hammer +2 more
openaire +2 more sources
The Connectivity of a Bipartite Graph and Its Bipartite Complementary Graph [PDF]
Parallel Processing Letters, 2020 In 1956, Nordhaus and Gaddum gave lower and upper bounds on the sum and the product of the chromatic number of a graph and its complement, in terms of the order of the graph. Since then, any bound on the sum and/or the product of an invariant in a graph [Formula: see text] and the same invariant in the complement [Formula: see text] of [Formula: see ...
Yingzhi Tian, Huaping Ma, Liyun Wu
openaire +3 more sources
A survey on bipartite graphs embedding
Social Network Analysis and Mining, 2023 Research on graph representation learning (a.k.a. embedding) has received great attention in recent years and shows effective results for various types of networks.
Edward Giamphy +3 more
semanticscholar +1 more source
Automorphism groups of some families of bipartite graphs
Electronic Journal of Graph Theory and Applications, 2021 This paper discusses the automorphism group of a class of weakly semiregular bipartite graphs and its subclass called WSBEND graphs. It also tries to analyse the automorphism group of the SM sum graphs and SM balancing graphs.
K.G. Sreekumar, K. Manilal
doaj +1 more source
Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs
Proceedings of the VLDB Endowment, 2022 Maximal bicliques are effective to reveal meaningful information hidden in bipartite graphs. Maximal biclique enumeration (MBE) is challenging since the number of the maximal bicliques grows exponentially w.r.t.
Lu Chen +4 more
semanticscholar +1 more source
Oriented bipartite graphs and the Goldbach graph [PDF]
Discrete Mathematics, 2021 In this paper, we study oriented bipartite graphs. In particular, we introduce "bitransitive" graphs. Several characterizations of bitransitive bitournaments are obtained. We show that bitransitive bitounaments are equivalent to acyclic bitournaments. As applications, we characterize acyclic bitournaments with Hamiltonian paths, determine number of non-
Sandip Das 0001 +3 more
openaire +2 more sources
Bipartite Graphs and Recommendation Systems
Journal of Advances in Information Technology, 2022 —Bipartite graphs are used to model many real-world relationships with applications in several domains, such as: medicine, social networks and marketing. Examples of such relationships include drugs-adverse reactions associations, links between genes and
Cristina Maier, D. Simovici
semanticscholar +1 more source