Results 21 to 30 of about 10,299 (219)
Inverses of Bipartite Graphs [PDF]
9 pages, 2 ...
Yujun Yang, Dong Ye 0002
openaire +3 more sources
Enumeration of Bipartite Graphs and Bipartite Blocks [PDF]
We use the theory of combinatorial species to count unlabelled bipartite graphs and bipartite blocks (nonseparable or 2-connected graphs). We start with bicolored graphs, which are bipartite graphs that are properly colored in two colors. The two-element group $\mathfrak{S}_2$ acts on these graphs by switching the colors, and connected bipartite graphs
Andrew Gainer-Dewar, Ira M. Gessel
openaire +3 more sources
Antimagic Labeling of Some Biregular Bipartite Graphs
An antimagic labeling of a graph G = (V, E) is a one-to-one mapping from E to {1, 2, . . ., |E|} such that distinct vertices receive different label sums from the edges incident to them. G is called antimagic if it admits an antimagic labeling.
Deng Kecai, Li Yunfei
doaj +1 more source
Teorema Pohon Matriks Untuk Menentukan Banyaknya Pohon Rentangan Graf Bipartisi Komplit (Km,n)
This research aims to observes panning tree number of complete bipartite graph (Km,n) by matrix-tree theorem.This research was using library research method which the step are:(1)Drawing complete bipartite graph (Km,n) where m= 1,2,3,4,and; (2)Determinin
Novia Rahmawati
doaj +1 more source
Modeling Bimodal Social Networks Subject to the Recommendation with the Cold Start User-Item Model
This paper describes the modeling of social networks subject to a recommendation. The Cold Start User-Item Model (CSUIM) of a bipartite graph is considered, which simulates bipartite graph growth based on several parameters.
Robert Albert Kłopotek
doaj +1 more source
Bipartite Graph Link Prediction Method Using Community Information [PDF]
Since bipartite graph contains two different types of nodes and links only exist between different types of nodes,most link prediction methods for common single graph cannot be applied to bipartite graphs directly.In addition,the community information ...
CAI Xiaoyu,CHEN Kejia,AN Chen
doaj +1 more source
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
On bipartite divisor graph for character degrees [PDF]
The concept of the bipartite divisor graph for integer subsets has been considered in [M. A. Iranmanesh and C. E. Praeger, Bipartite divisor graphs for integer subsets, Graphs Combin., 26 (2010) 95--105.].
Seyed Ali Moosavi
doaj +1 more source
Bipartite Domination in Graphs
The bipartite domination number of a graph is the minimum size of a dominating set that induces a bipartite subgraph. In this paper we initiate the study of this parameter, especially bounds involving the order, the ordinary domination number, and the chromatic number.
Bachstein, Anna +2 more
openaire +2 more sources
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

