Results 21 to 30 of about 1,011,259 (278)
Antimagic Labeling of Some Biregular Bipartite Graphs
Discussiones Mathematicae Graph Theory, 2022 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
Journal of Graph Algorithms and Applications, 2021 Let $G=(V,E)$ be a graph and let $S\subseteq V$ be a subset of its vertices. If the subgraph of $G$ induced by $V\setminus S$ is acyclic, then $S$ is said to be a decycling set of $G$. The size of a smallest decycling set of $G$ is called the decycling number of $G$. Determining the decycling number of a graph $G$ is NP-hard, even if $G$ is bipartite.
openaire +3 more sources
Bipartite Graph Link Prediction Method Using Community Information [PDF]
Jisuanji gongcheng, 2016 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
Bipartite Graph Embedding via Mutual Information Maximization [PDF]
Web Search and Data Mining, 2020 Bipartite graph embedding has recently attracted much attention due to the fact that bipartite graphs are widely used in various application domains. Most previous methods, which adopt random walk-based or reconstruction-based objectives, are typically ...
Jiangxia Cao +5 more
semanticscholar +1 more source
Advances in Applied Mathematics, 1999 Let \(R = K[t_1, \ldots , t_d]\) be the polynomial ring in \(d\) indeterminates over a field \(K\). If \(G\) is a bipartite graph on the vertex set \(\{ 1, \ldots , d \}\), define \(K[G]\) to be the subalgebra of \(R\) generated by all monomials \(t_i t_j\) such that \(\{ i,j \}\) is an edge of \(G\). It is shown that if every \(n\)-cycle \((n \geq 6)\)
Ohsugi, Hidefumi, Hibi, Takayuki
openaire +2 more sources
Bipartite Domination in Graphs
Mathematica Pannonica, 2022 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
Teorema Pohon Matriks Untuk Menentukan Banyaknya Pohon Rentangan Graf Bipartisi Komplit (Km,n)
Fokus, 2016 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
Computers, 2020 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
On bipartite divisor graph for character degrees [PDF]
International Journal of Group Theory, 2017 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
On maximal chain subgraphs and covers of bipartite graphs [PDF]
, 2016 In this paper, we address three related problems. One is the enumeration of all the maximal edge induced chain subgraphs of a bipartite graph, for which we provide a polynomial delay algorithm.
Calamoneri, Tiziana +4 more
core +1 more source