Results 111 to 120 of about 3,533,009 (320)
Mapana - Journal of Sciences, 2010 For a graph G, let G, L(G), J(G) S(G), L,(G) and M(G) denote Complement, Line graph, Jump graph, Splitting graph, Line splitting graph and Middle graph respectively. In this paper, we solve the graph equations L(G) =S(H), M(G) = S(H), L(G) = LS(H), M(G) =LS(H), J(G) = S(H), M(G) = S(H), J(G) = LS(H) and M(G) = LS(G).
Veena Mathad, B. Basavanagoud
openaire +3 more sources
Graphs whose line graphs are ring graphs [PDF]
AKCE International Journal of Graphs and Combinatorics, 2020 Given a graph H, a path of length at least two is called an H-path if meets H exactly in its ends. A graph G is a ring graph if each block of G which is not a bridge or a vertex can be constructed inductively by starting from a single cycle and then in each step adding an H-path that meets graph H in the previous step in two adjacent vertices.
openaire +3 more sources
Molecular Oncology, EarlyView.Trastuzumab‐deruxtecan, a HER2‐targeting antibody‐drug conjugate, shows promising antitumor activity in head and neck squamous cell carcinoma with low HER2 expression. In vitro and in vivo studies demonstrated dose‐dependent cell death and tumor growth reduction in low HER2‐expressing cell lines, which correlated with drug accumulation measured using a
Abdullah Bin Naveed +8 more
wiley +1 more source
On ordered graphs and graph orderings
Discrete Applied Mathematics, 1994 The main result of this paper is: For every oriented graph \(\vec G\) with in-degree for every vertex at least 2 there is no graph \(H\) such that every strong orientation \(\vec H\) of \(H\) contains a copy of \(\vec G\). This disproves a conjecture of \textit{M. Cochand} and \textit{P. Duchet} [Algorithms Comb. 8, 39-46 (1989; Zbl 0698.05055)].
openaire +2 more sources
Genomics‐led approach to drug testing in models of undifferentiated pleomorphic sarcoma
Molecular Oncology, EarlyView.GA text Genomic data from undifferentiated pleomorphic sarcoma patients and preclinical models were used to inform a targeted drug screen. Selected compounds were tested in 2D and 3D cultures of UPS cell lines. A combination of trametinib and infigratinib was synergistic in the majority of UPS cell lines tested, which was further confirmed in an ex ...
Piotr J. Manasterski +19 more
wiley +1 more source
Graph traversal and graph transformation
Theoretical Computer Science, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
On the Beta-Number of Forests with Isomorphic Components
Discussiones Mathematicae Graph Theory, 2018 The beta-number, β (G), of a graph G is defined to be either the smallest positive integer n for which there exists an injective function f : V (G) → {0, 1, . . .
Ichishima Rikio +3 more
doaj +1 more source
Vehicle Routing Problem Models
Promet (Zagreb), 2004 The Vehicle Routing Problem cannot always be solved exactly,so that in actual application this problem is solved heuristically.The work describes the concept of several concrete VRPmodels with simplified initial conditions (all vehicles are ofequal ...
Tonči Carić +2 more
doaj +1 more source
Molecular Oncology, EarlyView.This study identifies nuclear YB‐1 S102 phosphorylation as a marker associated with KRAS and FBXW7 mutations in colorectal cancer. Mutated KRAS correlates specifically with nuclear, not cytoplasmic, S102 YB‐1. These findings provide the first ex vivo evidence of this link in CRC and suggest future studies should assess the prognostic and therapeutic ...
Konstanze Lettau +9 more
wiley +1 more source
Clique graphs of packed graphs
Discrete Mathematics, 1986 Let \(| G|\) be the number of vertices of a graph G and \(\omega\) (G) the number of vertices in the largest clique of G. The clique graph K(G) is the intersection graph of the cliques of G. For all G, \(| K(G)| \leq 2^{| G| -\omega (G)}\) [see \textit{B. Hedman}, Discrete Math.
openaire +2 more sources