Results 91 to 100 of about 3,337,855 (342)
Theoretical Computer Science, 2016 Different graph generalizations have been recently used in an ad-hoc manner to represent multilayer networks, i.e. systems formed by distinct layers where each layer can be seen as a network. Similar constructions have also been used to represent time-varying networks.
Wehmuth, Klaus +2 more
openaire +5 more sources
Genomic landscape and preclinical models of angiosarcoma
Molecular Oncology, EarlyView.Angiosarcomas are a rare and aggressive cancer with a poor prognosis for patients. The genomic landscape of angiosarcoma can be highly complex and heterogenous; however, recent studies have identified some common features especially within anatomic and molecular subgroups.
Annaleigh Benton +3 more
wiley +1 more source
Heliyon, 2023 The tessellation problem is interesting to study, especially when it is associated with mathematical concepts. In this study, a graph coloring technique will be applied to solve the problem of wallpaper tessellation decoration. The main objective of this
Dafik +4 more
doaj
Construction of cospectral graphs [PDF]
arXiv, 2018 Construction of non-isomorphic cospectral graphs is a nontrivial problem in spectral graph theory specially for large graphs. In this paper, we establish that graph theoretical partial transpose of a graph is a potential tool to create non-isomorphic cospectral graphs by considering a graph as a clustered graph.
arxiv
Molecular Oncology, EarlyView.Adaptive ERK reactivation hinders FLT3 tyrosine kinase inhibitor (TKI) treatment in FLT3/ITD acute myeloid leukemia. Here, we report that FLT3 TKI treatment rapidly induces AXL expression and upregulation that is temporally associated with the adaptive ERK reactivation.
Tessa S. Seale +9 more
wiley +1 more source
Engineering Reports, 2020 Keeping an architecture description of a complex system consistent is difficult. View content is specified by viewpoints which draw upon an underlying metamodel. Viewpoints need to define consistency rules. This becomes increasingly hard as the metamodel
Nic Plum
doaj +1 more source
Characterisations of Intersection Graphs by Vertex Orderings [PDF]
Australasian J. Combinatorics 34:261-268, 2006, 2004 Characterisations of interval graphs, comparability graphs, co-comparability graphs, permutation graphs, and split graphs in terms of linear orderings of the vertex set are presented. As an application, it is proved that interval graphs, co-comparability graphs, AT-free graphs, and split graphs have bandwidth bounded by their maximum degree.
arxiv
Molecular Oncology, EarlyView.MiR‐99a‐5p/miR‐100‐5p (functionally identical) and miR‐125b‐5p microRNAs are downregulated in malignant germ cell tumors (GCTs). Combination replenishment of these microRNAs using mimics resulted in growth inhibition in representative cell lines, with consequent downregulation of target genes involved in cell cycle (confirmed by flow cytometry) and ...
Marta Ferraresso +12 more
wiley +1 more source
Balanced Cayley graphs and balanced planar graphs [PDF]
arXiv, 2007 A balanced graph is a bipartite graph with no induced circuit of length 2 mod 4. These graphs arise in linear programming. We focus on graph-algebraic properties of balanced graphs to prove a complete classification of balanced Cayley graphs on abelian groups.
arxiv
The Orchard crossing number of an abstract graph
, 2009 We introduce the Orchard crossing number, which is defined in a similar way to the well-known rectilinear crossing number. We compute the Orchard crossing number for some simple families of graphs. We also prove some properties of this crossing number.
Abstract Graph, David Garber, Elie Feder
core +2 more sources