Results 61 to 70 of about 96,628 (243)
Journal of Combinatorial Theory, Series B, 1981 AbstractFor k an integer, let G(a, b, k) denote a simple bipartite graph with bipartition (A, B) where |A| = a ≥ 2, |B| = b ≥ k ≥ 2, and each vertex of A has degree at least k. We prove two results concerning the existence of cycles in G(a, b, k).
openaire +3 more sources
Discrete Mathematics, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Vladimir Nikiforov +2 more
openaire +3 more sources
A typology of schools across the four nations of the United Kingdom: Class, race and geography
British Educational Research Journal, EarlyView.Abstract In this paper we analyse the hierarchical field of schools across the United Kingdom during the transition to university and suggest that there are five socially distinct clusters of schools. Our five‐cluster typology of UK schools is composed of an established group of elite private and state schools, schools for the white rural and suburban ...
Sol Gamsu, Håkan Forsberg
wiley +1 more source
Sidorenko's conjecture for blow-ups
Discrete Analysis, 2021 Sidorenko's conjecture for blow-ups, Discrete Analysis 2021:2, 13 pp. Let $G$ be a bipartite graph with finite vertex sets $X$ and $Y$. If $G$ has density $\alpha$, then the average degree of the vertices in $X$ is $\alpha|Y|$, so the mean-square degree
David Conlon, Joonkyung Lee
doaj +1 more source
On the metric dimension of bipartite graphs
AKCE International Journal of Graphs and Combinatorics, 2023 For an ordered subset [Formula: see text] of vertices and a vertex v in a connected graph G, the ordered k-vector [Formula: see text] is called the representation of v with respect to W, where [Formula: see text] is the distance between v and wi, for ...
M. Anandha Jothi, K. Sankar
doaj +1 more source
A polynomial-time approximation algorithm for the number of k-matchings in bipartite graphs [PDF]
, 2006 We show that the number of $k$-matching in a given undirected graph $G$ is equal to the number of perfect matching of the corresponding graph $G_k$ on an even number of vertices divided by a suitable factor.
Friedland, Shmuel, Levy, Daniel
core +1 more source
Discrete Mathematics, 2016 Recently, Milani and Trotignon introduced the class of equistarable graphs as graphs without isolated vertices admitting positive weights on the edges such that a subset of edges is of total weight $1$ if and only if it forms a maximal star. Based on equistarable graphs, counterexamples to three conjectures on equistable graphs were constructed, in ...
Endre Boros +2 more
openaire +3 more sources
Restricted Tweedie stochastic block models
Canadian Journal of Statistics, EarlyView.Abstract The stochastic block model (SBM) is a widely used framework for community detection in networks, where the network structure is typically represented by an adjacency matrix. However, conventional SBMs are not directly applicable to an adjacency matrix that consists of nonnegative zero‐inflated continuous edge weights.
Jie Jian, Mu Zhu, Peijun Sang
wiley +1 more source
Journal of Robotics, 2020 The paper discusses the solution of the assignment task between two groups of mobile (MR) objects. The assignment task is to determine the purpose of MR to each other when playing football.
Denis Aleksandrovich Beloglazov +3 more
doaj +1 more source
Research on Commodities Constraint Optimization Based on Graph Neural Network Prediction
IEEE Access, 2023 Business intelligence makes good sale prediction crucial in any commercial activity as it has a significant impact on production and supply plan. However, practical commercial data presents explicit constraints, that how to get the optimal forecasts of ...
Zhang Yang +5 more
doaj +1 more source