Results 91 to 100 of about 3,489,698 (302)
Properly Edge-colored Theta Graphs in Edge-colored Complete Graphs [PDF]
With respect to specific cycle-related problems, edge-colored graphs can be considered as a generalization of directed graphs. We show that properly edge-colored theta graphs play a key role in characterizing the difference between edge-colored complete ...
Broersma, Hajo; id_orcid +3 more
core +2 more sources
High‐risk bladder cancer is typically treated with Bacillus Calmette‐Guérin (BCG), but 30–40% of patients relapse. No FDA‐ or CE‐approved biomarkers currently predict or prognosticate BCG failure. We systematically reviewed the literature and identified 72 eligible studies, revealing several promising biomarkers associated with BCG treatment response ...
Rui Ribeiro‐Pereira +7 more
wiley +1 more source
Commuting graphs of gamma rings
Let M be a non-commutative gamma ring and ZΓM ${Z}_{{\Gamma}}\left(M\right)$ denote the center of the gamma ring M. The vertices a and b are consecutive if a ≠ b and aαb = bαa for every α ∈ Γ, with vertices taken from the set M−ZΓM $M-{Z}_{{\Gamma ...
Arslan Okan
doaj +1 more source
End Behavior of the Threshold Protocol Game on Complete and Bipartite Graphs
The threshold protocol game is a graphical game that models the adoption of an idea or product through a population. There are two states players may take in the game, and the goal of the game is to motivate the state that begins in the minority to ...
Alexandra Fedrigo
doaj +1 more source
Isocitrate dehydrogenase 1 (IDH1) mutations are highly recurrent in multiple human cancer types, including cholangiocarcinoma and glioma. IDH1 R132C is the most common IDH1 mutation in cholangiocarcinoma and likely arises from APOBEC3A‐ or APOBEC3B‐mediated deamination.
Kelly E. Butler +3 more
wiley +1 more source
Counting links in complete graphs [PDF]
We find the minimal number of non-trivial links in an embedding of any complete kk-partite graph on 7 vertices (including K7, which has at least 21 non-trivial links).
Fleming, Thomas, Mellor, Blake
core +1 more source
Signed Complete Graphs with Maximum Index
Let Γ = (G, σ) be a signed graph, where G is the underlying simple graph and σ E(G) → {−, +} is the sign function on the edges of G. The adjacency matrix of a signed graph has −1 or +1 for adjacent vertices, depending on the sign of the edges.
Akbari Saieed +3 more
doaj +1 more source
This study identifies ARHGAP5, in addition to the frequently mutated ARHGAP35, as significantly mutated in endometrial cancer. Mutations in both genes co‐occur and are associated with their correlated downregulation. Functional CRISPR studies show that both paralogs regulate similar pathways, including actin cytoskeleton organization.
Mathilde Pinault +12 more
wiley +1 more source
Partitioning graphs into complete and empty graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tínaz Ekim, John Gimbel
openaire +1 more source
Incomplete microwave ablation (iMWA) of liver cancer triggers a biphasic progression in residual tumors. At Day 3, the microenvironment is characterized by acute inflammatory responses and extracellular matrix (ECM) remodeling. By Day 14, a profound shift occurs toward oncogenic signal transduction and immunosuppression, marked by macrophage ...
Yu Liu +9 more
wiley +1 more source

