Results 91 to 100 of about 140,780 (247)

On the Line Graph of the Complete Bipartite Graph

, 1964
In an interesting recent article [4], J. W. Moon has given a list of properties of the graph $L(B_{mn})$ (to be defined more precisely below) and investigated the question of whether these properties characterize the graph. In case $m = n$, this question
A. Hoffman
semanticscholar   +1 more source

Ecological graph theory: Simulating competition and coexistence on graphs

Methods in Ecology and Evolution, EarlyView.
Abstract Since its inception, the evolutionary graph theory (EGT) has been extensively used to study the fixation probability, the rate of evolution, game‐theoretical topics and related questions in a spatially structured framework. However, few attempts have been made to use this framework in ecology.
Ata Kalirad, Ralf J. Sommer
wiley   +1 more source

Adjective‐based qualitative comparative analysis: Relating immobility situations across contexts

Area, EarlyView.
Short Abstract This paper introduces an adjective‐based qualitative comparative method for analysing complex lived experiences across diverse contexts. By identifying, harmonising, and relationally comparing salient descriptive adjectives derived from qualitative data, the approach enables structured yet interpretively rich cross‐case comparison ...
Josef Novotný, Aneta Stoker, Takuya Nakagawa, Kristýna Kvasničková, Eliška Masná, Mohammed Yeboah   +5 more
wiley   +1 more source

Artificial intelligence streamlines scientific discovery of drug–target interactions

British Journal of Pharmacology, EarlyView.
Abstract Drug discovery is a complicated process through which new therapeutics are identified to prevent and treat specific diseases. Identification of drug–target interactions (DTIs) stands as a pivotal aspect within the realm of drug discovery and development. The traditional process of drug discovery, especially identification of DTIs, is marked by
Yuxin Yang, Feixiong Cheng
wiley   +1 more source

Decomposition of Regular Bipartite Graphs Into Hamiltonian Cycles (Paths) and S3

Journal of Mathematics
Let G be either a complete bipartite graph with n (even) vertices in each partite or a complete bipartite graph with n (odd) vertices in each partite plus a 1‐factor.
null V. Nalini, null S. Jeevadoss
doaj   +1 more source

The importin‐alpha superfamily engages in ethylene signaling by shuttling ETHYLENE INSENSITIVE 2 from the endoplasmic reticulum to the nucleus

The FEBS Journal, EarlyView.
The plant hormone ethylene regulates plant growth, ripening, senescence, and stress responses. The hormonal signal transmission, from receptors at the ER membrane to the transcriptional regulators in the nucleus, is still not completely understood.
Fabian Wynen, Jan Eric Maika, Raphael Josef Eberle, Nina Jahnke, Marcel Wiermer, Laura Hartmann, Rüdiger Simon, Georg Groth   +7 more
wiley   +1 more source

Automated path‐planning strategy for robotic inspection of underground utilities based on building information model

Computer-Aided Civil and Infrastructure Engineering, EarlyView.
Abstract This paper proposes a fully automated end‐to‐end inspection‐path‐planning strategy for underground utilities, such as pipelines, based on building information modeling (BIM). An automatic extraction method is developed to process utility information from BIM models, using a registration step that pairs each pipeline with its corresponding ...
Zihan Yang, Jiangpeng Shu, Jishuang Jiang, Wentao Han, Yichang Wang, Liang Zhao, Yong Bai   +6 more
wiley   +1 more source

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

Conserved spatial patterning of gene expression in independent lineages of C4 plants

New Phytologist, EarlyView.
Summary C4 photosynthesis enhances carbon fixation efficiency by reducing photorespiration through the use of an oxygen‐insensitive carboxylase and spatial separation of photosynthesis between mesophyll and bundle sheath cells. The C4 pathway has evolved independently in > 60 plant lineages, but molecular mechanisms underpinning this convergence remain
Tianshu Sun, Venkata Suresh Bonthala, Benjamin Stich, Leonie H. Luginbuehl, Julian M. Hibberd   +4 more
wiley   +1 more source