Results 81 to 90 of about 2,598,126 (331)

Laplacian Spectral Characterization of Signed Sun Graphs

Theory and Applications of Graphs, 2023
A sun SGn is a graph of order 2n consisting of a cycle Cn, n ≥ 3, to each vertex of it a pendant edge is attached. In this paper, we prove that unbalanced signed sun graphs are determined by their Laplacian spectra.
Fatemah Motialah, Mohammad Hassan Shirdareh Haghighi   +1 more
doaj   +1 more source

Chordally signed graphs

Discrete Applied Mathematics, 2002
AbstractDefine a chordally signed graph to be a signed chordal graph (meaning that each edge is designated as being positive or negative and every induced cycle is a triangle) in which every positive cycle C (meaning every cycle C that contains an even number of negative edges) has a chord e such that C∪{e} forms two positive cycles.
openaire   +2 more sources

Cellular liquid biopsy provides unique chances for disease monitoring, preclinical model generation and therapy adjustment in rare salivary gland cancer patients

Molecular Oncology, EarlyView.
We quantified and cultured circulating tumor cells (CTCs) of 62 patients with various cancer types and generated CTC‐derived tumoroid models from two salivary gland cancer patients. Cellular liquid biopsy‐derived information enabled molecular genetic assessment of systemic disease heterogeneity and functional testing for therapy selection in both ...
Nataša Stojanović Gužvić, Florian Lüke, Steffi Treitschke, Andrea Coluccio, Martin Hoffmann, Giancarlo Feliciello, Adithi Ravikumar Varadarajan, Xin Lu, Kathrin Weidele, Catherine Botteron, Silvia Materna–Reichelt, Felix Keil, Katja Evert, Florian Weber, Thomas Schamberger, Michael Althammer, Jirka Grosse, Dirk Hellwig, Christian Schulz, Stephan Seitz, Peter Ugocsai, Anke Schlenska‐Lange, Roman Mayr, Ulrich Kaiser, Wolfgang Dietmaier, Bernhard Polzer, Jens Warfsmann, Kamran Honarnejad, Tobias Pukrop, Daniel Heudobler, Christoph A. Klein, Christian Werno   +31 more
wiley   +1 more source

Strong Structural Controllability of Signed Networks

, 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, Mesbahi, Mehran, Mousavi, Shima Sadat   +2 more
core   +1 more source

Cell‐free DNA aneuploidy score as a dynamic early response marker in prostate cancer

Molecular Oncology, EarlyView.
mFast‐SeqS‐based genome‐wide aneuploidy scores are concordant with aneuploidy scores obtained by whole genome sequencing from tumor tissue and can predict response to ARSI treatment at baseline and, at an early time point, to ARSI and taxanes. This assay can be easily performed at low cost and requires little input of cfDNA. Cell‐free circulating tumor
Khrystany T. Isebia, Anouk C. de Jong, Lisanne F. van Dessel, Vanja de Weerd, Corine Beaufort, Jean Helmijr, José Alberto Nakauma‐González, Job van Riet, Paul Hamberg, Daniel Vis, Michiel S. van der Heijden, Nick Beije, Martijn P. Lolkema, Teoman Deger, Saskia M. Wilting, Ronald de Wit, Maurice P. H. M. Jansen, John W. M. Martens   +17 more
wiley   +1 more source

The common minimal common neighborhood dominating signed graphs [PDF]

Transactions on Combinatorics, 2013
In this paper, we define the common minimal common neighborhooddominating signed graph (or common minimal $CN$-dominating signedgraph) of a given signed graph and offer a structuralcharacterization of common minimal $CN$-dominating signed graphs.In the ...
Kavita S Permi, K.R. Rajanna, P.Siva Kota Reddy   +2 more
doaj  

Signed graph coloring

Discrete Mathematics, 1982
AbstractColoring a signed graph by signed colors, one has a chromatic polynomial with the same enumerative and algebraic properties as for ordinary graphs. New phenomena are the interpretability only of odd arguments and the existence of a second chromatic polynomial counting zero-free colorings. The generalization to voltage graphs is outlined.
openaire   +1 more source

TOMM20 as a driver of cancer aggressiveness via oxidative phosphorylation, maintenance of a reduced state, and resistance to apoptosis

Molecular Oncology, EarlyView.
TOMM20 increases cancer aggressiveness by maintaining a reduced state with increased NADH and NADPH levels, oxidative phosphorylation (OXPHOS), and apoptosis resistance while reducing reactive oxygen species (ROS) levels. Conversely, CRISPR‐Cas9 knockdown of TOMM20 alters these cancer‐aggressive traits.
Ranakul Islam, Megan E. Roche, Zhao Lin, Diana Whitaker‐Menezes, Victor Diaz‐Barros, Eurico Serrano, Maria Paula Martinez Cantarin, Nancy J. Philp, Atrayee Basu Mallick, Ubaldo Martinez‐Outschoorn   +9 more
wiley   +1 more source

List homomorphism problems for signed graphs

, 2021
We consider homomorphisms of signed graphs from a computational perspective. In particular, we study the list homomorphism problem seeking a homomorphism of an input signed graph $(G,\sigma)$, equipped with lists $L(v) \subseteq V(H), v \in V(G)$, of ...
Bok, Jan, Brewster, Richard, Feder, Tomás, Hell, Pavol, Jedličková, Nikola   +4 more
core  

Degree of an edge and Platt Number in signed networks

Ratio Mathematica, 2023
Positive labelled edges play a vital role in network analysis.The degree of edges in signed graphs is introduced by giving importance to positive edges incident on the end vertices of that edge. The concept of Platt number of a graph, which is the sum of
Diviya K D, Anjaly Kishore
doaj   +1 more source