Results 81 to 90 of about 2,715,030 (252)

Agronomic and nutritional performance of lentil–hull‐less barley mixtures under temperate Swiss conditions: protein content, protein yield stability, β‐glucan content and separation ability

Journal of the Science of Food and Agriculture, EarlyView.
Abstract BACKGROUND Intercropping of legumes with cereals enhances resilience, resource efficiency, and nutritional quality in food systems, yet few studies have integrated yield stability with grain quantity and post‐harvest processability. Lentils (Lens culinaris Medik.) and hull‐less barley (Hordeum vulgare L. var.
Filippo Carmenati, Stefania Giacomozzi, Yannik Schlup, Eveline Jenny, Andreas Kägi, Johan Six, Susanne Vogelgsang   +6 more
wiley   +1 more source

Allocation of Indivisible Items With a Common Preference Graph: Minimizing Total Dissatisfaction

Networks, EarlyView.
ABSTRACT Allocating indivisible items among a set of agents is a frequently studied discrete optimization problem. In the setting considered in this work, the agents' preferences over the items are assumed to be identical. We consider a very recent measure for the overall quality of an allocation which does not rely on numerical valuations of the items.
Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanič, Peter Muršič, Ulrich Pferschy   +6 more
wiley   +1 more source

Effects on Seidel energy of two special types of graphs by perturbing edges

Kuwait Journal of Science
Let G be a simple undirected graph, and let S(G) be its Seidel matrix. The Seidel energy of G is defined as ES(G)=∑i=1n|λS(G)|, where λS(G),λS(G),…,λS(G) are Seidel eigenvalues of G.
doaj   +1 more source

P3-Factorization of complete bipartite graphs

Discrete Mathematics, 1988
Let \(P_ 3\) be a path of 3 points and \(K_{m,n}\) be a complete bipartite graph with partite sets \(V_ 1\) and \(V_ 2\), where \(| V_ 1| =m\) and \(| V_ 2| =n.\) A spanning subgraph F of \(K_{m,n}\) is called a \(P_ 3\)-factor if each component of F is isomorphic to \(P_ 3\). If \(K_{m,n}\) is expressed as a line-disjoint sum of \(P_ 3\)-factors, then
openaire   +3 more sources

On the Complexity of the Paper Selection Problem for the Italian Research Quality Evaluation (VQR)

Networks, EarlyView.
ABSTRACT This work addresses the paper selection problem that each Italian university and department faced in the context of the research quality evaluation (VQR) of the Italian university system for the period 2020–2024. Given the set of researchers of a university and their associated papers, the problem consists of selecting a fixed number of ...
Francesco Carrabs, Martina Cerulli, Carmine Sorgente   +2 more
wiley   +1 more source

Star-path and star-stripe bipartite Ramsey numbers in multicoloring [PDF]

Transactions on Combinatorics, 2015
‎For given bipartite graphs G 1 ‎,‎G 2 ,…‎,‎G t , the bipartite Ramsey number bR(G 1 ‎,‎G 2 ,…‎,‎G t ) is the‎ ‎smallest integer n such that if the edges of the complete bipartite graph K n,n are partitioned into t disjoint color classes giving t ...
Ghaffar Raeisi
doaj  

The Bipartite-Splittance of a Bipartite Graph

Discussiones Mathematicae Graph Theory, 2019
A bipartite-split graph is a bipartite graph whose vertex set can be partitioned into a complete bipartite set and an independent set. The bipartite- splittance of an arbitrary bipartite graph is the minimum number of edges to be added or removed in ...
Yin Jian-Hua, Guan Jing-Xin
doaj   +1 more source

Topological Symmetry Groups of Complete Bipartite Graphs [PDF]

, 2016
The symmetries of complex molecular structures can be modeled by the {\em topological symmetry group} of the underlying embedded graph. It is therefore important to understand which topological symmetry groups can be realized by particular abstract ...
Hake, Kathleen, Mellor, Blake, Pittluck, Matthew   +2 more
core  

Graceful Labelling for Complete Bipartite Fuzzy Graphs

, 2017
The concept of fuzzy graceful labelling is introduced. A graph which admits a fuzzy graceful labelling is called a fuzzy graceful graph. Fuzzy graceful labelled graphs are becoming an increasingly useful family of mathematical models for a broad range of
R. Jebesty Shajila, S. Vimala
core   +1 more source

Fault‐Tolerant Mutual‐Visibility: Complexity and Solutions for Grid‐Like Networks

Networks, EarlyView.
ABSTRACT Networks are often modeled using graphs, and within this setting we introduce the notion of k$$ k $$‐fault‐tolerant mutual visibility. Informally, a set of vertices X⊆V(G)$$ X\subseteq V(G) $$ in a graph G$$ G $$ is a k$$ k $$‐fault‐tolerant mutual‐visibility set (k$$ k $$‐ftmv set) if any two non‐adjacent vertices in X$$ X $$ are connected by
Serafino Cicerone, Gabriele Di Stefano, Sandi Klavžar, Gang Zhang   +3 more
wiley   +1 more source