Results 51 to 60 of about 63,549 (264)
The Oriented Graph Complexes [PDF]
Communications in Mathematical Physics, 2014 The oriented graph complexes GCorn are complexes of directed graphs without directed cycles. They govern, for example, the quantization of Lie bialgebras and infinite dimensional deformation quantization. Similar to the ordinary graph complexes GC n introduced by Kontsevich they come in two essentially different versions, depending on the parity of n ...
openaire +3 more sources
On the Most Imbalanced Orientation of a Graph [PDF]
Journal of Combinatorial Optimization, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Walid Ben-Ameur +2 more
openaire +2 more sources
Oriented Diameter of Star Graphs [PDF]
Discrete Applied Mathematics, 2020 An {\em orientation} of an undirected graph $G$ is an assignment of exactly one direction to each edge of $G$. Converting two-way traffic networks to one-way traffic networks and bidirectional communication networks to unidirectional communication networks are practical instances of graph orientations.
K. S. Ajish Kumar +2 more
openaire +3 more sources
Molecular Oncology, EarlyView.The novel styrylquinazolinone‐based molecule W1B effectively suppresses glioblastoma by inhibiting IGF1R and EGFR. In high‐glucose microenvironments driving tumor resistance, W1B acts synergistically with the EGFR inhibitor dacomitinib. This combination safely blocks compensatory survival signaling in zebrafish xenograft models. Showcasing promising in
Patryk Rurka +9 more
wiley +1 more source
Advanced Engineering Materials, EarlyView.This article presents the NFDI‐MatWerk Ontology (MWO), a Basic Formal Ontology‐based framework for interoperable research data management in materials science and engineering (MSE). Covering consortium structures, research data management resources, services, and instruments, MWO enables semantic integration, Findable, Accessible, Interoperable, and ...
Hossein Beygi Nasrabadi +4 more
wiley +1 more source
Independent Detour Transversals in 3-Deficient Digraphs
Discussiones Mathematicae Graph Theory, 2013 In 1982 Laborde, Payan and Xuong [Independent sets and longest directed paths in digraphs, in: Graphs and other combinatorial topics (Prague, 1982) 173-177 (Teubner-Texte Math., 59 1983)] conjectured that every digraph has an independent detour ...
van Aardt Susan +2 more
doaj +1 more source
Proceedings of the American Mathematical Society, 2022 We investigate when a Borel graph admits a (Borel or measurable) orientation with outdegree bounded by k k for various ...
openaire +2 more sources
Advanced Engineering Materials, EarlyView.A numerical–experimental framework is developed for characterizing multi‐matrix fiber‐reinforced polymers (MM‐FRPs) combining epoxy and polyurethane matrices. Harmonic bending tests are integrated with finite element model updating (FEMU) to simultaneously identify elastic and viscoelastic material parameters.
Rodrigo M. Dartora +4 more
wiley +1 more source
Obstructions to some injective oriented colourings
Theory and Applications of GraphsEach of several possible definitions of local injectivity for a homomorphism of an oriented graph $G$ to an oriented graph $H$ leads to an injective oriented colouring problem.
Russell J Campbell +2 more
doaj +1 more source
Discussiones Mathematicae Graph Theory, 2018 A digraph is called irregular if its distinct vertices have distinct degree pairs. An irregular digraph is called minimal (maximal) if the removal of any arc (addition of any new arc) results in a non-irregular digraph. It is easily seen that the minimum
Górska Joanna +4 more
doaj +1 more source