Results 11 to 20 of about 92,446 (202)
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 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
European Journal of Combinatorics, 1996 Graphs that are obtained from single edges and even cycles by successive amalgamations are called cellular graphs. Especially cellular bipartite graphs are investigated in this paper. Since graphs with their shortest-path metrics are particular instances of finite metric spaces, these investigations are done from a metric point of view.
Bandelt, Hans-Jürgen, Chepoi, Victor
openaire +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
The step Sidorenko property and non-norming edge-transitive graphs [PDF]
, 2019 Sidorenko's Conjecture asserts that every bipartite graph H has the Sidorenko property, i.e., a quasirandom graph minimizes the density of H among all graphs with the same edge density.
Král', Daniel +3 more
core +2 more sources
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2019 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
Embedding into Bipartite Graphs [PDF]
SIAM Journal on Discrete Mathematics, 2010 16 pages, 2 ...
Böttcher, Julia +2 more
openaire +2 more sources