Results 31 to 40 of about 974,445 (260)

Effect of edge-subdivision on vertex-domination in a graph

Discussiones Mathematicae Graph Theory, 2002
Let \(G\) be a graph with maximum degree \(\Delta> 1\). Let there exist a subset of the edge set of \(G\) such that by subdividing each edge of the subset exactly once a graph with domination number greater than that of \(G\) is obtained. Then the minimum cardinality of such a set is the subdivision number \(\xi(G)\) of \(G\). In the paper it is stated
Amitava Bhattacharya, Gurusamy Rengasamy Vijayakumar   +1 more
openaire   +1 more source

Further results on (1,0,0)-F-Face magic mean graphs [PDF]

Songklanakarin Journal of Science and Technology (SJST), 2020
A (1,0,0)-F-Face magic mean labeling is an assignment of labels to the vertices of planar graph such that the mean weight of each face including an exterior face is constant.
A. Meena Kumari, S. Arockiaraj
doaj   +1 more source

Discrete Differential Form Subdivision and Vector Field Generation over Volumetric Domain [PDF]

, 2012
This thesis presents a new method to construct smooth l- and 2-form subdivision schemes over the 3D volumetric domain. Based on the subdivided 1- and 2-form coefficient field, smooth vector fields can be constructed using Whitney forms.
Huang, Jinghao
core   +1 more source

Developmental programmes drive cellular plasticity, disease progression and therapy resistance in lung adenocarcinoma

Molecular Oncology, EarlyView.
This study shows that lung adenocarcinomas exploit developmental branching morphogenesis to acquire a therapy resistant basal‐like tumour cell state. This process was found to be regulated by combined TP53 loss‐of‐function and type‐I interferon signalling, identifying a novel axis for biomarker and therapeutic target discovery.
Kamila J Bienkowska, Stephany Gallardo, Nur S. Zainal, Leena Arora, Matthew Ellis, Maria‐Antoinette Lopez, Judith Austine, Sai Pittla, Serena J Chee, Aiman Alzetani, Emily C Shaw, Christian H Ottensmeier, Gareth J Thomas, Christopher J Hanley   +13 more
wiley   +1 more source

Separating edges by linearly many subdivisions

Procedia Computer Science
We prove that for any two graphs $G$ and $H$, the edges of $G$ can be strongly separated by a collection of linearly many subdivisions of $H$ and single edges. This confirms a conjecture of Botler and Naia.
George Kontogeorgiou, Matías Pavez-Signé, Maya Stein, S. Taruni, Ana Trujillo-Negrete   +4 more
openaire   +2 more sources

Spatial and single‐nuclei transcriptomics reveals idiosyncratic and generic patterns in papillary and anaplastic thyroid cancers

Molecular Oncology, EarlyView.
Matched spatial transcriptomics and single‐nuclei RNA‐seq were generated for anaplastic and BRAFV600E papillary thyroid cancers revealing generic and tumor‐specific states occurring in cancer cells and in the tumor microenvironment. In this context, cancer dedifferentiation mirrored organoid maturation through ordered thyroid marker gain/loss ...
Adrien Tourneur, Joel Rodrigues Vitória, Manuel Saiselet, Ligia Craciun, Denis Larsimont, Anne Lefort, Frédérick Libert, Carine Maenhaut, Sabine Costagliola, Maxime Tarabichi, Mirian Romitti, Vincent Detours   +11 more
wiley   +1 more source

Generalized Characteristic Polynomials of Join Graphs and Their Applications

Discrete Dynamics in Nature and Society, 2017
The Kirchhoff index of G is the sum of resistance distances between all pairs of vertices of G in electrical networks. LEL(G) is the Laplacian-Energy-Like Invariant of G in chemistry.
Pengli Lu, Ke Gao, Yang Yang
doaj   +1 more source

Separating the Edges of a Graph by Cycles and by Subdivisions of K4

Journal of Graph Theory
ABSTRACTA separating system of a graph is a family of subgraphs of for which the following holds: for all distinct edges and of , there exists an element in that contains but not . Recently, it has been shown that every graph of order admits a separating system consisting of paths, improving the previous almost linear bound of , and settling ...
Fábio Botler, Tássio Naia
openaire   +3 more sources

Minimum rank of edge subdivisions of graphs

The Electronic Journal of Linear Algebra, 2009
Let F be a field, let G be an undirected graph on n vertices, and let S(F, G) be the set of all F -valued symmetric n × n matrices whose nonzero off-diagonal entries occur in exactly the positions corresponding to the edges of G. The minimum rank of G over F is defined to be mr(F, G) = min{rank A| A 2 S(F, G)}.
Wayne Barrett, Ryan Bowcutt, Mark Cutler, Seth Gibelyou, Kayla Owens   +4 more
openaire   +1 more source

Purification and preparation of Marchantia polymorpha Auxin Response Factor 2 for phase separation studies

FEBS Open Bio, EarlyView.
We describe detailed protocols for the purification and preparation of Marchantia polymorpha Auxin Response Factor 2 (MpARF2). This protein is fused to an MBP solubility tag and an mNG fluorescent tag and is purified from Escherichia coli. The presented procedures make it possible to study MpARF2 assemblies, which could arise from phase separation ...
Bas Janssen, Robin Romein, Willy A. M. van den Berg, Simon Lindhoud, Jan Willem Borst, Carlo P. M. van Mierlo   +5 more
wiley   +1 more source