Results 111 to 120 of about 2,542,324 (299)
Absolutely Harmonious Labeling of Graphs [PDF]
, 2011 In this paper, we obtain necessary conditions for a graph to be absolutely harmonious and study absolutely harmonious behavior of certain classes of ...
Lourdusamy, A., Seenivasan, M.
core +1 more source
Oncogenic DMTF1β promotes cancer cell motility by regulating autophagy through ULK1 stabilization
Molecular Oncology, EarlyView.In the current study, we demonstrate that the oncogene DMTF1β regulates ULK1 stability by reducing its proteasomal degradation in cancer cells. This stabilization enables ULK1 to induce autophagy, which in turn facilitates cancer cell migration. Consequently, reduced DMTF1β levels lead to decreased autophagy and impaired cancer cell migration.
Jun Xu +13 more
wiley +1 more source
Independent sets of maximum weight in apple-free graphs [PDF]
, 2010 We present the first polynomial-time algorithm to solve the maximum weight independent set problem for apple-free graphs, which is a common generalization of several important classes where the problem can be solved efficiently, such as claw-free graphs,
Lozin, Vadim V. +2 more
core +1 more source
Molecular Oncology, EarlyView.Matched spatial transcriptomics and single‐nuclei RNA‐seq were generated for anaplastic and BRAFV600E papillary thyroid cancers revealing generic and tumor‐specific states occurring in cancer cells and in the tumor microenvironment. In this context, cancer dedifferentiation mirrored organoid maturation through ordered thyroid marker gain/loss ...
Adrien Tourneur +11 more
wiley +1 more source
Maximal outerplanar graphs as chordal graphs, path-neighborhood graphs, and triangle graphs [PDF]
Maximal outerplanar graphs are characterized using three different classes of graphs. A path-neighborhood graph is a connected graph in which every neighborhood induces a path. The triangle graph $T(G)$ has the triangles of the graph $G$ as its vertices,
Novick, B., Laskar, R.C., Mulder, H.M.
core
On some metric properties of supertoken graphs
In this paper, we construct two infinite families of graphs and , where, in both cases, a vertex label is with . We provide a tight lower bound on the metric dimension of .
Baskoro, Edy Tri +3 more
core +1 more source
Long Dominating Cycles in Graphs [PDF]
, 2007 All graphs considered in this paper will be finite and simple.
Zhiren, Sun, Yongga, A.
core +1 more source
Do Graph Readers Prefer the Graph Type Most Suited to a Given Task? Insights from Eye Tracking
Journal of Eye Movement Research, 2016 Research on graph comprehension suggests that point differences are easier to read in bar graphs, while trends are easier to read in line graphs. But are graph readers able to detect and use the most suited graph type for a given task?
Benjamin Strobel +3 more
doaj +1 more source
A Geometric Property of the Laplacian matrix of a Connected Nonsingular Mixed Graph
Journal of Chemistry, 2020 In this paper, we give a geometric interpretation of the Laplacian matrix of a connected nonsingular mixed graph which generalizes the results of M. Fiedler (M. Fiedler, Geometry of the Laplacian, Linear Algebra Appl., 2005, 403: 409–413).
Zheng-Da Zhou, Shi-Cai Gong
doaj +1 more source
New concepts of inverse fuzzy mixed graphs and its application. [PDF]
Granul Comput, 2022 Poulik S, Ghorai G.
europepmc +1 more source