Results 71 to 80 of about 337,641 (297)

Signed star (k,k)-domatic number of a graph [PDF]

open access: yesOpuscula Mathematica, 2014
Let \(G\) be a simple graph without isolated vertices with vertex set \(V(G)\) and edge set \(E(G)\) and let \(k\) be a positive integer. A function \(f:E(G)\longrightarrow \{-1, 1\}\) is said to be a signed star \(k\)-dominating function on \(G\) if ...
S. M. Sheikholeslami, L. Volkmann
doaj   +1 more source

Applications of Structural Balance in Signed Social Networks [PDF]

open access: yes, 2014
We present measures, models and link prediction algorithms based on the structural balance in signed social networks. Certain social networks contain, in addition to the usual 'friend' links, 'enemy' links.
Kunegis, Jérôme
core  

Strong Structural Controllability of Signed Networks

open access: yes, 2019
In this paper, we discuss the controllability of a family of linear time-invariant (LTI) networks defined on a signed graph. In this direction, we introduce the notion of positive and negative signed zero forcing sets for the controllability analysis of ...
Haeri, Mohammad   +2 more
core   +1 more source

Survivin and Aurora Kinase A control cell fate decisions during mitosis

open access: yesMolecular Oncology, EarlyView.
Aurora A interacts with survivin during mitosis and regulates its centromeric role. Loss of Aurora A activity mislocalises survivin, the CPC and BubR1, leading to disruption of the spindle checkpoint and triggering premature mitotic exit, which we refer to as ‘mitotic slippage’.
Hana Abdelkabir   +2 more
wiley   +1 more source

Laplacian Spectral Properties of Signed Circular Caterpillars

open access: yesTheory and Applications of Graphs, 2020
A circular caterpillar of girth $n$ is a graph such that the removal of all pendant vertices yields a cycle $C_n$ of order $n$. A signed graph is a pair $\Gamma=(G, \sigma)$, where $G$ is a simple graph and $\sigma: E(G) \rightarrow \{+1, -1\}$ is the ...
Maurizio Brunetti
doaj   +1 more source

Projective-planar signed graphs and tangled signed graphs

open access: yesJournal of Combinatorial Theory, Series B, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

Liquid biopsy epigenetics: establishing a molecular profile based on cell‐free DNA

open access: yesMolecular Oncology, EarlyView.
Cell‐free DNA (cfDNA) fragments in plasma from cancer patients carry epigenetic signatures reflecting their cells of origin. These epigenetic features include DNA methylation, nucleosome modifications, and variations in fragmentation. This review describes the biological properties of each feature and explores optimal strategies for harnessing cfDNA ...
Christoffer Trier Maansson   +2 more
wiley   +1 more source

Orientation of Signed Graphs

open access: yesEuropean Journal of Combinatorics, 1991
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Balancing signed graphs

open access: yesDiscrete Applied Mathematics, 1981
AbstractA signed graph based on F is an ordinary graph F with each edge marked as positive or negative. Such a graph is called balanced if each of its cycles includes an even number of negative edges. Psychologists are sometimes interested in the smallest number d=d(G) such that a signed graph G may be converted into a balanced graph by changing the ...
Akiyama, J.   +3 more
openaire   +1 more source

Home - About - Disclaimer - Privacy