Results 51 to 60 of about 1,814,953 (245)
Total Minimal Dominating Signed Graph [PDF]
, 2010 Cartwright and Harary considered graphs in which vertices represent persons and the edges represent symmetric dyadic relations amongst persons each of which designated as being positive or negative according to whether the nature of the relationship is ...
Reddy, Siva Kota, Vijay, S.
core +1 more source
The undirected power graph on the conjugacy classes of a finite group [PDF]
AUT Journal of Mathematics and ComputingLet $G$ be a finite group. The undirected power graph on the conjugacy classes of $G$ is the simple graph $\mathcal{P_C}(G)$ whose vertices are the conjugacy classes of $G$ and two distinct vertices $C$ and $C'$ are adjacent if one is a subset of a power
Sajjad Mahmood Robati
doaj +1 more source
Indivisibility for classes of graphs
Discrete MathematicsWe examine indivisibility for classes of graphs. We show that the class of hereditarily $α$-sparse graphs is indivisible if and only if $α> 2$. Additionally, we show that the following classes of graphs are indivisible: perfect graphs, cographs, and chordal graphs, and the following classes of graphs are not indivisible: threshold graphs, split ...
Vincent Guingona +5 more
openaire +3 more sources
On Computing Longest Paths in Small Graph Classes [PDF]
, 2007 The longest path problem is the one that finds a longest path in a given graph. While the graph classes in which the Hamiltonian path problem can be solved efficiently are widely investigated, few graph classes are known to be solved efficiently for the ...
RYUHEI UEHARA +3 more
core +1 more source
On Ultralimits of Sparse Graph Classes
The Electronic Journal of Combinatorics, 2016 The notion of nowhere denseness is one of the central concepts of the recently developed theory of sparse graphs. We study the properties of nowhere dense graph classes by investigating appropriate limit objects defined using the ultraproduct construction.
Michal Pilipczuk, Szymon Torunczyk
openaire +4 more sources
Pediatric Blood &Cancer, EarlyView.ABSTRACT We assessed the effect of iron overload (IO) on mortality and complications following hematopoietic stem cell transplantation (HSCT) in patients with Diamond–Blackfan anemia syndrome (DBAS) in a systematic review of individual participant data and cohort data from observational studies.
Geoffrey Z. L. Kuppens +6 more
wiley +1 more source
From mice to humans—divergent strategies for intestinal homeostasis and regeneration
FEBS Letters, EarlyView.Recent advances such as organoid genome editing, xenotransplantation, imaging, and whole‐genome sequencing have enabled direct studies of human intestinal stem cells (ISCs). These studies reveal species‐specific features, including slower ISC proliferation, distinct injury responses, slower somatic mutation accumulation in humans, and an inverse ...
Keiko Ishikawa +2 more
wiley +1 more source
Labeling, Covering and Decomposing of Graphs — Smarandache’s Notion in Graph Theory [PDF]
, 2010 This paper surveys the applications of Smarandache’s notion to graph theory appeared in International J.Math.Combin. from Vol.1,2008 to Vol.3,2009.
Mao, Linfan, Linfan Mao
core +1 more source
Graph polynomials for a class of DI-pathological graphs [PDF]
AKCE International Journal of Graphs and Combinatorics, 2020 Let be a simple graph. A dominating set is a set such that the closed neighborhood of is the entire vertex set. An independence set of a graph is a subset of vertices that are pairwise non-adjacent. A DI-pathological graph is a graph where every minimum dominating set intersects every maximal independent set. Let denote the number of dominating sets of
James M. Hammer, Joshua Harrington
openaire +3 more sources
Modelling stem cell differentiation related processes—A practical overview for biologists
FEBS Letters, EarlyView.Stem cell differentiation is complex and difficult to control experimentally. This review introduces suitable computational modelling approaches that can support stem cell research, from mechanistic ODE and abstract models to multiscale and deep learning methods.
Ricco Zeegelaar +4 more
wiley +1 more source