Results 111 to 120 of about 143,400 (232)
Plant Biotechnology Journal, EarlyView.ABSTRACT Plant viruses are recognized as rapid and effective vectors to deliver CRISPR‐Cas reaction components into plants, a strategy termed virus‐induced gene editing (VIGE). However, VIGE is limited by the host range of the viral vectors. Development of new viral vectors to target a broad range of plant species will potentially enable the delivery ...
Fernando Merwaiss +3 more
wiley +1 more source
P 4-Colorings and P 4-Bipartite Graphs
Discrete Mathematics & Theoretical Computer Science, 2001 A vertex partition of a graph into disjoint subsets V i s is said to be a P 4-free coloring if each color class V i induces a subgraph without chordless path on four vertices (denoted by P 4).
Chính T. Hoàng, Van Bang Le
doaj
On cyclic orthogonal double covers of circulant graphs by special infinite graphs
AKCE International Journal of Graphs and Combinatorics, 2017 In this article, a technique to construct cyclic orthogonal double covers (CODCs) of regular circulant graphs by certain infinite graph classes such as complete bipartite and tripartite graphs and disjoint union of butterfly and is introduced.
R. El-Shanawany, A. El-Mesady
doaj +1 more source
AKCE International Journal of Graphs and Combinatorics, 2020 An edge labeled graph is a graph whose edges are labeled with non-zero ideals of a commutative ring . A Generalized Spline on an edge labeled graph is a vertex labeling of by elements of the ring , such that the difference between any two adjacent vertex
Radha Madhavi Duggaraju, Lipika Mazumdar
doaj +1 more source
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 +12 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 +2 more
openaire +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 +3 more
wiley +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 +3 more
wiley +1 more source
On Cartesian Products of Orthogonal Double Covers
International Journal of Mathematics and Mathematical Sciences, 2013 Let H be a graph on n vertices and 𝒢 a collection of n subgraphs of H, one for each vertex, where 𝒢 is an orthogonal double cover (ODC) of H if every edge of H occurs in exactly two members of 𝒢 and any two members share an edge whenever the ...
R. El Shanawany, M. Higazy, A. El Mesady
doaj +1 more source