Bipartite Diametrical Graphs of Diameter 4 and Extreme Orders [PDF]
International Journal of Mathematics and Mathematical Sciences, 2008 We provide a process to extend any bipartite diametrical graph of diameter 4 to an 𝑆-graph of the same diameter and partite sets. For a bipartite diametrical graph of diameter 4 and partite sets 𝑈 and 𝑊, where 2𝑚=|𝑈|≤|𝑊|, we prove that 2𝑚 is a sharp ...
Salah Al-Addasi, Hasan Al-Ezeh
doaj +2 more sources
Antifactors of regular bipartite graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 Let $G=(X,Y;E)$ be a bipartite graph, where $X$ and $Y$ are color classes and $E$ is the set of edges of $G$. Lov\'asz and Plummer \cite{LoPl86} asked whether one can decide in polynomial time that a given bipartite graph $G=(X,Y; E)$ admits a 1-anti ...
Hongliang Lu, Wei Wang, Juan Yan
doaj +3 more sources
Decomposition of Certain Complete Bipartite Graphs into Prisms
Discussiones Mathematicae Graph Theory, 2017 Häggkvist [6] proved that every 3-regular bipartite graph of order 2n with no component isomorphic to the Heawood graph decomposes the complete bipartite graph K6n,6n.
Froncek Dalibor
doaj +2 more sources
Minimum k-critical-bipartite graphs: the irregular case [PDF]
Opuscula MathematicaWe study the problem of finding a minimum \(k\)-critical-bipartite graph of order \((n,m)\): a bipartite graph \(G=(U,V;E)\), with \(|U|=n\), \(|V|=m\), and \(n\gt m\gt 1\), which is \(k\)-critical-bipartite, and the tuple \((|E|, \Delta_U, \Delta_V ...
Sylwia Cichacz +2 more
doaj +2 more sources
A random walk-based method to identify driver genes by integrating the subcellular localization and variation frequency into bipartite graph. [PDF]
BMC Bioinformatics, 2019 Song J, Peng W, Wang F.
europepmc +3 more sources
A review of recommendation system research based on bipartite graph [PDF]
MATEC Web of Conferences, 2021 The interaction history between users and items is usually stored and displayed in the form of bipartite graphs. Neural network recommendation based on the user-item bipartite graph has a significant effect on alleviating the long-standing data ...
Wu Ziteng +3 more
doaj +1 more source
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
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
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