Results 81 to 90 of about 34,352 (308)
Towards an Aesthetic Invariant for Graph Drawing [PDF]
, 2002 In this paper we do not address the question of visualization, of picture processing of visual information. The information for us is already processed and ,typically, it is of a very simple type such as drawing (however not necessary a graph drawing ...
Jaroslav Nešetřil +3 more
core +1 more source
Molecular Oncology, EarlyView.Patient‐derived organoids (PDOs) from pancreatic, colorectal, and gastric cancers were used to evaluate standard and experimental therapies. Incorporating cancer‐associated fibroblasts (CAFs) into organoid cultures improved patient therapy outcome prediction.
Marcin Grochowski +12 more
wiley +1 more source
Atom–bond connectivity index of graphs: a review over extremal results and bounds [PDF]
Discrete Mathematics Letters, 2021 Akbar Ali +3 more
doaj +1 more source
A Bond Graph Approach for the Modeling and Simulation of a Buck Converter
Journal of Low Power Electronics and Applications, 2018 This paper deals with the modeling of bond graph buck converter systems. The bond graph formalism, which represents a heterogeneous formalism for physical modeling, is used to design a sub-model of a power MOSFET and PiN diode switchers. These bond graph
Rached Zrafi, Sami Ghedira, Kamel Besbes
doaj +1 more source
FEBS Open Bio, EarlyView.Time‐resolved X‐ray solution scattering captures how proteins change shape in real time under near‐native conditions. This article presents a practical workflow for light‐triggered TR‐XSS experiments, from data collection to structural refinement. Using a calcium‐transporting membrane protein as an example, the approach can be broadly applied to study ...
Fatemeh Sabzian‐Molaei +3 more
wiley +1 more source
Some improved bounds on two energy-like invariants of some derived graphs
Open Mathematics, 2019 Given a simple graph G, its Laplacian-energy-like invariant LEL(G) and incidence energy IE(G) are the sum of square root of its all Laplacian eigenvalues and signless Laplacian eigenvalues, respectively. This paper obtains some improved bounds on LEL and
Cui Shu-Yu, Tian Gui-Xian
doaj +1 more source
A Survey on the Cyclic Coloring and its Relaxations
Discussiones Mathematicae Graph Theory, 2021 A cyclic coloring of a plane graph is a vertex coloring such that any two vertices incident with the same face receive distinct colors. This type of coloring was introduced more than fifty years ago, and a lot of research in chromatic graph theory was ...
Czap Július +2 more
doaj +1 more source
FEBS Open Bio, EarlyView.Time‐restricted feeding (TRF) in mice increased liver fatty acid oxidation and decreased fatty acid biosynthesis. These alterations persisted when TRF was discontinued and the host was infected with Mycobacterium tuberculosis. Pre‐exposure to TRF did not alter tissue (lung and spleen) mycobacterial burden but significantly reduced CD3+ T cells in lungs
Ashish Gupta +7 more
wiley +1 more source
INGRID: A graph invariant manipulator
Journal of Symbolic Computation, 1989 INGRID, a software system for assisting researchers and students of graph theory, is described. It is a partial commentative rule-based system using forward chaining, consists of approximately 1200 production rules, and is written in Berkeley Pascal on a VAX 11/780 under UNIX.
Dutton, Ronald D. +2 more
openaire +3 more sources
Some Invariants of Flower Graph [PDF]
Applied Mathematics and Nonlinear Sciences, 2018 Abstract Let G be a graph and let m ij ( G ) , i, j ≥ 1, represents the number of edge of
Virk, Abaid ur Rehman, Quraish, Muhammad
openaire +2 more sources