Results 61 to 70 of about 339,158 (270)
Signed star (k,k)-domatic number of a graph [PDF]
Opuscula 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]
, 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
On signed degrees in signed graphs [PDF]
Czechoslovak Mathematical Journal, 1994 A graph is called signed if there is a designation of its edges as either positive or negative. The signed degree of a vertex \(v\) is the number of positive edges through \(v\) less the number of negative edges through \(v\). The degree sequence consists of signed degrees of all vertices in nonincreasing order.
Chartrand, Gary +3 more
openaire +2 more sources
Molecular Oncology, EarlyView.Tumors contain diverse cellular states whose behavior is shaped by context‐dependent gene coordination. By comparing gene–gene relationships across biological contexts, we identify adaptive transcriptional modules that reorganize into distinct vulnerability axes.
Brian Nelson +9 more
wiley +1 more source
The common minimal dominating signed graph [PDF]
Transactions on Combinatorics, 2012 In this paper, we define the common minimal dominating signedgraph of a given signed graph and offer a structuralcharacterization of common minimal dominating signed graphs. Inthe sequel, we also obtained switching equivalencecharacterizations: $overline{
P. Siva Reddy, B. Prashanth
doaj
Edge-Dual Graph Preserving Sign Prediction for Signed Social Networks
IEEE Access, 2017 Though existing works of sign prediction have reasonable prediction performances, they suffer from the data sparseness problem, especially for the negative link prediction.
Weiwei Yuan +3 more
doaj +1 more source
Homomorphisms of planar signed graphs to signed projective cubes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 We conjecture that every signed graph of unbalanced girth 2g, whose underlying graph is bipartite and planar, admits a homomorphism to the signed projective cube of dimension 2g1.
Reza Naserasr +2 more
doaj +1 more source
The complexity of signed graph and edge-coloured graph homomorphisms
, 2016 We study homomorphism problems of signed graphs from a computational point of view. A signed graph $(G,\Sigma)$ is a graph $G$ where each edge is given a sign, positive or negative; $\Sigma\subseteq E(G)$ denotes the set of negative edges.
Brewster, Richard C. +3 more
core +1 more source
Discrete Applied MathematicsLet $G$ be a graph and $A$ be its adjacency matrix. A graph $G$ is invertible if its adjacency matrix $A$ is invertible and the inverse of $G$ is a weighted graph with adjacency matrix $A^{-1}$. A signed graph $(G,σ)$ is a weighted graph with a special weight function $σ: E(G)\to \{-1,1\}$. A graph is sign-invertible (or sign-invertible) if its inverse
Isaiah Osborne, Dong Ye
openaire +2 more sources
COMP–PMEPA1 axis promotes epithelial‐to‐mesenchymal transition in breast cancer cells
Molecular Oncology, EarlyView.This study reveals that cartilage oligomeric matrix protein (COMP) promotes epithelial‐to‐mesenchymal transition (EMT) in breast cancer. We identify PMEPA1 (protein TMEPAI) as a novel COMP‐binding partner that mediates EMT via binding to the TSP domains of COMP, establishing the COMP–PMEPA1 axis as a key EMT driver in breast cancer.
Konstantinos S. Papadakos +6 more
wiley +1 more source