Results 31 to 40 of about 482,213 (239)

Axiomatic characterization of the interval function of partial cubes and partial Hamming graphs

AKCE International Journal of Graphs and Combinatorics
Interval function of a graph is a well-known notion in metric graph theory and the axiomatic characterization using a set of first order axioms of different graph classes is an interesting problem in this area.
Jeny Jacob, Manoj Changat, Lekshmi Kamal K. Sheela, Abhirami R. S, Amrutha U.A.   +4 more
doaj   +1 more source

Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. Chapter I: theory

Journal of Graph Algorithms and Applications, 2017
This is the first of two chapters of a work in which we consider the unrestricted, minimal, and bounded representation problems for unit interval (UIG) and unit circular-arc (UCA) graphs. In the unrestricted version, a proper circular-arc (PCA) model ${\mathcal{M}}$ is given and the goal is to obtain an equivalent UCA model ${\mathcal{U}}$. In
openaire   +3 more sources

A Graph Theory Approach for Regional Controllability of Boolean Cellular Automata

, 2019
Controllability is one of the central concepts of modern control theory that allows a good understanding of a system's behaviour. It consists in constraining a system to reach the desired state from an initial state within a given time interval. When the
Bagnoli, Franco, Dridi, Sara, Fontaine, Allyx, Yacoubi, Samira El   +3 more
core   +3 more sources

Interval Type 2 Fuzzy Set in Fuzzy Shortest Path Problem

Mathematics, 2016
The shortest path problem (SPP) is one of the most important combinatorial optimization problems in graph theory due to its various applications. The uncertainty existing in the real world problems makes it difficult to determine the arc lengths exactly.
Arindam Dey, Anita Pal, Tandra Pal
doaj   +1 more source

Spanning connectedness and Hamiltonian thickness of graphs and interval graphs [PDF]

Discrete Mathematics & Theoretical Computer Science, 2015
A spanning connectedness property is one which involves the robust existence of a spanning subgraph which is of some special form, say a Hamiltonian cycle in which a sequence of vertices appear in an arbitrarily given ordering, or a Hamiltonian path in ...
Peng Li, Yaokun Wu
doaj   +1 more source

Automorphism Groups of Geometrically Represented Graphs [PDF]

, 2015
We describe a technique to determine the automorphism group of a geometrically represented graph, by understanding the structure of the induced action on all geometric representations.
Klavík, Pavel, Zeman, Peter
core  

On singular probability densities generated by extremal dynamics

, 2004
Extremal dynamics is the mechanism that drives the Bak-Sneppen model into a (self-organized) critical state, marked by a singular stationary probability density $p(x)$.
Bak, Boettcher, Bose, Caldarelli, Dickman, Dickman, Donangelo, Dorogovtsev, Drossel, Felici, Grassberger, Guilherme J.M. Garcia, Head, Head, Li, Marsili, Maslov, Meester, Mikeska, Paczuski, Paczuski, Pismak, Rios, Ronald Dickman   +23 more
core   +1 more source

Genetic attenuation of ALDH1A1 increases metastatic potential and aggressiveness in colorectal cancer

Molecular Oncology, EarlyView.
Aldehyde dehydrogenase 1A1 (ALDH1A1) is a cancer stem cell marker in several malignancies. We established a novel epithelial cell line from rectal adenocarcinoma with unique overexpression of this enzyme. Genetic attenuation of ALDH1A1 led to increased invasive capacity and metastatic potential, the inhibition of proliferation activity, and ultimately ...
Martina Poturnajova, Zuzana Kozovska, Ondrej Pos, Kristina Pavlov, Sachin Gulati, Peter Makovicky, Kristina Jakic, Monika Burikova, Eva Sedlackova, Barbora Svitkova, Silvia Tyciakova, Vojtech Bystry, Nicolas Blavet, Boris Tichy, Matej Hrnciar, Jaroslav Budis, Miroslav Tomas, Peter Dubovan, Georgina Kolnikova, Veronika Repaska, Nikoleta Mojzesova, Eva Zomborska, Daniel Pindak, Michal Mego, Tomas Szemes, Miroslava Matuskova   +25 more
wiley   +1 more source

Anticipation of ventricular tachyarrhythmias by a novel mathematical method: Further insights towards an early warning system in implantable cardioverter defibrillators.

PLoS ONE, 2020
Implantable cardioverter defibrillators (ICD) are the most effective therapy to terminate malignant ventricular arrhythmias (VA) and therefore to prevent sudden cardiac death. Until today, there is no way to predict the onset of such VA.
Gabriel S Zamudio, Manlio F Márquez, Marco V José   +2 more
doaj   +2 more sources

Quantifying Uncertainty in Brain Network Measures using Bayesian Connectomics

Frontiers in Computational Neuroscience, 2014
The wiring diagram of the human brain can be described in terms of graph measures that characterize structural regularities. These measures require an estimate of whole-brain structural connectivity for which one may resort to deterministic or ...
Ronald Johannes Janssen, Max eHinne, Max eHinne, Tom eHeskes, Marcel A.J. Van Gerven   +4 more
doaj   +1 more source