Results 121 to 130 of about 153,964 (249)

General Symmetric Starter of Orthogonal Double Covers of Complete Bipartite Graph

International Journal of Mathematics and Mathematical Sciences, 2007
An orthogonal double cover (ODC) of the complete graph is a collection of graphs such that every two of them share exactly one edge and every edge of the complete graph belongs to exactly two of the graphs.
R. A. El-Shanawany, M. Sh. Higazy
doaj   +1 more source

Generalized Matching Preclusion in Bipartite Graphs

Theory and Applications of Graphs, 2018
The matching preclusion number of a graph with an even number of vertices is the minimum number of edges whose deletion results in a graph that has no perfect matchings. For many interconnection networks, the optimal such sets are precisely sets of edges
Zachary Wheeler, Eddie Cheng, Dana Ferranti, Laszlo Liptak, Karthik Nataraj   +4 more
doaj   +1 more source

How to optimise tournament draws: The case of the FIFA World Cup

International Transactions in Operational Research, EarlyView.
Abstract The organisers of major sports competitions use different policies with respect to constraints in the group draw. Our paper aims to rationalise these choices by analysing the trade‐off between attractiveness (the number of games played by teams from the same geographic zone) and fairness (the departure of the draw mechanism from a uniform ...
László Csató
wiley   +1 more source

DNA Methylation Shapes Seed‐Borne Microbiome and Proteome Responses During Early Maize‐Beneficial Bacteria Interactions

Plant, Cell &Environment, EarlyView.
ABSTRACT Microorganism and plant interactions are crucial for development and environmental adaptation. Plant growth promoting bacteria enhance agricultural productivity in a sustainable manner, while epigenetic modifications such as DNA methylation regulate gene expression and adaptive responses.
Pedro Igor Zocateli, Geovanna Vitória de Olímpio, Felipe Astolpho de Almeida, Letícia Oliveira da Rocha, Diego Vinicius de Sena Martins, Sara Sangi, Fábio Lopes Olivares, Elyabe Monteiro de Matos, Juliana Siqueira, Lyderson Facio Viccini, Roberta Pena da Paschoa, Vanildo Silveira, Clícia Grativol   +12 more
wiley   +1 more source

Complexity of Join and Corona graphs and Chebyshev polynomials

Journal of Taibah University for Science, 2018
Boesh and Prodinger have shown how to use properties of Chebyshev polynomials to compute formulas for the number of spanning trees of some special graphs.
S. N. Daoud
doaj   +1 more source

Graph‐based imitation and reinforcement learning for efficient Benders decomposition

AIChE Journal, Volume 72, Issue 6, June 2026.
Abstract This work introduces an end‐to‐end graph‐based agent for accelerating the computational efficiency of Benders Decomposition. The agent's policy is parameterized by a graph neural network, which takes as input a bipartite graph representation of the master problem and proposes a candidate solution.
Bernard T. Agyeman, Zhe Li, Ilias Mitrai, Prodromos Daoutidis   +3 more
wiley   +1 more source

Embedding Complete Bipartite Graphs into Necklace Graphs

Procedia Computer Science, 2020
Abstract Graph embedding is an important technique used in studying the problem of efficiently implementing parallel algorithms on parallel computers. Wirelength is an embedding parameter widely studied in data structures and data representations, electrical networks, VLSI network and chemical graphs.
openaire   +1 more source

On the Pagenumber of Complete Bipartite Graphs

Journal of Combinatorial Theory, Series B, 1997
An embedding of a simple graph \(G\) into a book is a placing of the vertices of \(G\) along the spine of the book together with a placing of the edges on the pages such that there is no page with crossing edges. The pagenumber \(p(G)\) is the minimum of pages within which \(G\) can be book embedded. Let \(K_{m,n}\) be the complete bipartite graph. The
Enomoto, Hikoe, Nakamigawa, Tomoki, Ota, Katsuhiro   +2 more
openaire   +1 more source

Properly Colored Cycles in Edge‐Colored Balanced Bipartite Graphs

Journal of Graph Theory, Volume 112, Issue 2, Page 37-53, June 2026.
ABSTRACT Let G n , n c denote a (not necessarily properly) edge‐colored balanced bipartite graph on 2 n vertices, that is, in which every edge is assigned a color. A cycle C in G n , n c is called properly colored if any two consecutive edges of C have distinct colors.
Tingting Han, Hajo Broersma, Shenggui Zhang, Yandong Bai   +3 more
wiley   +1 more source

Another Proof of the Generalized Tutte—Berge Formula for f‐Bounded Subgraphs

Journal of Graph Theory, Volume 112, Issue 2, Page 145-150, June 2026.
ABSTRACT Given a nonnegative integer weight f ( v ) for each vertex v in a multigraph G, an f‐bounded subgraph of G is a multigraph H contained in G such that d H ( v ) ≤ f ( v ) for all v ∈ V ( G ). Using Tutte's f‐Factor Theorem, we give a new proof of the min–max relation for the maximum size of an f‐bounded subgraph of G. When f ( v ) = 1 for all v,
Zishen Qu, Douglas B. West
wiley   +1 more source