Results 61 to 70 of about 2,715,030 (252)
Advanced Science, EarlyView.The transcription factor MoSR governs DMI fungicide sensitivity in Magnaporthe oryzae through dual regulation of ergosterol biosynthesis and the detoxification enzyme MoDde1. Targeting MoDde1 via a small‐molecule inhibitor or host‐induced gene silencing enhances DMI efficacy against rice blast, offering a sustainable disease management strategy ...
Fan‐Zhu Meng +10 more
wiley +1 more source
International Journal of Applied Mathematics and Computer ScienceThis paper introduces the concept of filters in a rough bi-Heyting algebra. The rough bi-Heyting algebra defined through the rough semiring offers interesting properties.
Praba Bashyam +1 more
doaj +1 more source
Completing partial packings of bipartite graphs
Journal of Combinatorial Theory, Series A, 2011 Given a bipartite graph $H$ and an integer $n$, let $f(n;H)$ be the smallest integer such that, any set of edge disjoint copies of $H$ on $n$ vertices, can be extended to an $H$-design on at most $n+f(n;H)$ vertices. We establish tight bounds for the growth of $f(n;H)$ as $n \rightarrow \infty$.
Zoltán Füredi +2 more
openaire +2 more sources
Higher matching complexes of complete graphs and complete bipartite graphs [PDF]
Discrete Mathematics, 2022 For $r\geq 1$, the $r$-matching complex of a graph $G$, denoted $M_r(G)$, is a simplicial complex whose faces are the subsets $H \subseteq E(G)$ of the edge set of $G$ such that the degree of any vertex in the induced subgraph $G[H]$ is at most $r$. In this article, we give a closed form formula for the homotopy type of the $(n-2)$-matching complex of ...
openaire +3 more sources
Decomposition of Complete Bipartite Graphs into Cycles of Distinct Even Lengths
, 2016 Let Kn,n be the complete bipartite graph with two parts of equal size n. In this paper, it is shown that depending on whether n is even or odd, Kn,n or Kn,n−I , where I is a 1-factor of Kn,n , can be decomposed into cycles of distinct even lengths ...
Fu, Chin-Mei;Huang, Kuo-Ching;Mishima, Miwako
core +1 more source
Topological Ramsey Theorem for Complete Bipartite Graphs [PDF]
, 1994 An embedding of a graph into a space is linear if each edge is a straight line segment. In 1991, Negami showed that for any given knot, link, or spatial graph there is a sufficiently large complete graph Kn such that every linear embedding of Kn into a ...
Miyauchi, M.S.
core +1 more source
RNA‐centric world of retroviruses: unravelling the molecular strategies of genomic RNA packaging
Biological Reviews, EarlyView.ABSTRACT Retroviruses constitute a unique group of RNA viruses that have profoundly influenced both evolutionary trajectories and biomedical research. Their ability to reverse transcribe and integrate into host genomes has shaped genomic architecture across species and contributed to our understanding of oncogenes, gene regulation, and RNA biology ...
Mohammad Abdullah Jehad +5 more
wiley +1 more source
Decomposition of complete bipartite graphs into generalized prisms [PDF]
, 2013 R. Häggkvist proved that every 3-regular bipartite graph of order 2n with no component isomorphic to the Heawood graph decomposes the complete bipartite graph K6n,6n.
Cichacz, Sylwia +2 more
core +1 more source
On Odd Covers of Cliques and Disjoint Unions
Journal of Graph Theory, EarlyView.ABSTRACT Babai and Frankl posed the “odd cover problem” of finding the minimum cardinality of a collection of complete bipartite graphs such that every edge of the complete graph of order n $n$ is covered an odd number of times. In a previous paper with O'Neill, some of the authors proved that this value is always ⌈ n / 2 ⌉ $\lceil n/2\rceil $ or ⌈ n /
Calum Buchanan +7 more
wiley +1 more source
Regular embeddings of complete bipartite maps: classification and enumeration
The regular embeddings of complete bipartite graphs Kn, n in orientable surfaces are classified and enumerated, and their automorphism groups and combinatorial properties are determined.
Jones, Gareth
core +1 more source