Results 71 to 80 of about 839,618 (278)

Extending Undirected Graph Techniques to Directed Graphs via Category Theory

Mathematics
We use Category Theory to construct a ‘bridge’ relating directed graphs with undirected graphs, such that the notion of direction is preserved. Specifically, we provide an isomorphism between the category of simple directed graphs and a category we call ‘
Sebastian Pardo-Guerra, Vivek Kurien George, Vikash Morar, Joshua Roldan, Gabriel Alex Silva   +4 more
doaj   +1 more source

Fixed Points of Set Valued Mappings in Terms of Start Point on a Metric Space Endowed with a Directed Graph

Mathematics, 2017
In the present article, we introduce the new concept of start point in a directed graph and provide the characterizations required for a directed graph to have a start point.
Murchana Neog, Pradip Debnath
doaj   +1 more source

Descending endomorphism graphs of groups

AKCE International Journal of Graphs and Combinatorics, 2023
We define a new type of graph of a group with reference to the descending endomorphisms of the group. A descending endomorphism of a group is an endomorphism that induces a corresponding endomorphism in every homomorphic image of the group. We define the
Vinay Madhusudanan, G. Sudhakara, Arjit Seth   +2 more
doaj   +1 more source

Directed Graph Exploration [PDF]

, 2012
We study the problem of exploring all nodes of an unknown directed graph. A searcher has to construct a tour that visits all nodes, but only has information about the parts of the graph it already visited. The goal is to minimize the cost of such a tour.
Klaus-Tycho Förster, Roger Wattenhofer
openaire   +1 more source

Plecstatin inhibits hepatocellular carcinoma tumorigenesis and invasion through cytolinker plectin

Molecular Oncology, EarlyView.
The ruthenium‐based metallodrug plecstatin exerts its anticancer effect in hepatocellular carcinoma (HCC) primarily through selective targeting of plectin. By disrupting plectin‐mediated cytoskeletal organization, plecstatin inhibits anchorage‐dependent growth, cell polarization, and tumor cell dissemination.
Zuzana Outla, Jan Kosla, Magdalena Prechova, Lukas Frick, Patricia Bortel, Yasmin Borutzki, Andrea Bileck, Christopher Gerner, Samuel M. Meier‐Menches, Selma Osmanagic‐Myers, Martin Gregor   +10 more
wiley   +1 more source

Infrared laser sampling of low volumes combined with shotgun lipidomics reveals lipid markers in palatine tonsil carcinoma

Molecular Oncology, EarlyView.
Nanosecond infrared laser (NIRL) low‐volume sampling combined with shotgun lipidomics uncovers distinct lipidome alterations in oropharyngeal squamous cell carcinoma (OPSCC) of the palatine tonsil. Several lipid species consistently differentiate tumor from healthy tissue, highlighting their potential as diagnostic markers.
Leonard Kerkhoff, Manuela Moritz, Dennis Eggert, Anna Worthmann, Joerg Heeren, Henrike Zech, Till S. Clauditz, Waldemar Wilczak, Hartmut Schlüter, Christian S. Betz, Arne Böttcher, Jan Hahn   +11 more
wiley   +1 more source

TRAIL‐PEG‐Apt‐PLGA nanosystem as an aptamer‐targeted drug delivery system potential for triple‐negative breast cancer therapy using in vivo mouse model

Molecular Oncology, EarlyView.
Aptamers are used both therapeutically and as targeting agents in cancer treatment. We developed an aptamer‐targeted PLGA–TRAIL nanosystem that exhibited superior therapeutic efficacy in NOD/SCID breast cancer models. This nanosystem represents a novel biotechnological drug candidate for suppressing resistance development in breast cancer.
Gulen Melike Demirbolat, Aslihan Kucuk, Omer Erdogan, Samed Ozer, Bensu Kozan, Tugba Cuceli, Erkan Gumus, Evrim Cevik, Ozge Cevik   +8 more
wiley   +1 more source

Edge-weighted anonymity for directed network graph

Intelligent and Converged Networks
In social networks, weighted graph anonymity is gaining more and more attention. But fan-following graphs like Twitter’s are not protected by anonymity.
Yanze Huang, Jianghong Lin, Wei Li, Jiaru Wang, Limei Lin   +4 more
doaj   +1 more source

Testing Uniformity of Stationary Distribution [PDF]

, 2016
A random walk on a directed graph gives a Markov chain on the vertices of the graph. An important question that arises often in the context of Markov chain is whether the uniform distribution on the vertices of the graph is a stationary distribution of ...
Chakraborty, Sourav, Kamath, Akshay, Pratap, Rameshwar   +2 more
core  

Packing and Covering a Given Directed Graph in a Directed Graph

SIAM Journal on Discrete Mathematics
For every fixed $k \ge 4$, it is proved that if an $n$-vertex directed graph has at most $t$ pairwise arc-disjoint directed $k$-cycles, then there exists a set of at most $\frac{2}{3}kt+ o(n^2)$ arcs that meets all directed $k$-cycles and that the set of $k$-cycles admits a fractional cover of value at most $\frac{2}{3}kt$.
openaire   +3 more sources