Results 31 to 40 of about 64,345 (264)
Heroes in Orientations of Chordal Graphs
SIAM Journal on Discrete Mathematics, 2022 We characterize all digraphs $H$ such that orientations of chordal graphs with no induced copy of $H$ have bounded dichromatic number.
Pierre Aboulker +2 more
openaire +4 more sources
Discrete Applied Mathematics, 2002 If \(V(G)\) is the vertex set of a connected oriented graph \(D\) then for two vertices \(u,v \in V(G)\) a shortest directed \(u\)-\(v\) path is called \(u\)-\(v\) geodesic. The closed interval \(I[u,v]\) consists of \(u\) and \(v\) together with all vertices lying in a \(u\)-\(v\) geodesic or in a \(v\)-\(u\) geodesic in \(D\). For \(S \subseteq V(D)\)
Gary Chartrand +2 more
openaire +1 more source
Notes on Knaster-Tarski Theorem versus Monotone Nonexpansive Mappings
Moroccan Journal of Pure and Applied Analysis, 2018 The purpose of this note is to discuss the recent paper of Espínola and Wiśnicki about the fixed point theory of monotone nonexpansive mappings. In their work, it is claimed that most of the fixed point results of this class of mappings boil down to the ...
Khamsi Mohamed Amine
doaj +1 more source
An Orientation Theorem for Graphs
Journal of Combinatorial Theory, Series B, 1994 We characterize the class of graphs in which the edges can be oriented in such a way that going along any circuit in the graph, the number of forward edges minus the number of backward edges is equal to 0, 1, or \(- 1\). The result follows by applying Tutte's characterization of regular matroids to a certain binary matroid associated to a graph.
openaire +3 more sources
On the in–out–proper orientations of graphs [PDF]
Discrete Applied Mathematics, 2021 An orientation of a graph $G$ is {\it in-out-proper} if any two adjacent vertices have different in-out-degrees, where the in-out-degree of each vertex is equal to the in-degree minus the out-degree of that vertex. The {\it in-out-proper orientation number} of a graph $G$, denoted by $\overleftrightarrowχ(G)$, is $ \min_{D\in Γ}\max_{v\in V(G)} |d_D ...
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
Research and Application of Hypernetwork Energy
Jisuanji kexue yu tansuo, 2021 Graph energy plays an important role in research of graph theory. Graph energy and many other similar variants have been applied in many other types of graphs, e.g., undirected graphs, oriented graphs, mixed graphs, and so on.
LIU Shengjiu, LI Tianrui, LIU Jia, XIE Peng
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
Molecular Oncology, EarlyView.LUNAR is a liver‐specific long noncoding RNA (lncRNA) that is highly expressed in normal liver but becomes epigenetically silenced in hepatocellular carcinoma through promoter hypermethylation. Loss of LUNAR is associated with NOTCH activation, epithelial–mesenchymal transition, and metastasis, whereas restoring LUNAR restrains metastatic progression ...
Se Ha Jang +9 more
wiley +1 more source
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