Results 101 to 110 of about 15,625 (297)
On Fundamental Solution for Autonomous Linear Retarded Functional Differential Equations
Mathematics, 2020 This document focuses attention on the fundamental solution of an autonomous linear retarded functional differential equation (RFDE) along with its supporting cast of actors: kernel matrix, characteristic matrix, resolvent matrix; and the Laplace ...
Clement McCalla
doaj +1 more source
Liquid biopsy‐based diagnostic evaluation of hypermethylated CpG sites for ovarian cancer diagnosis
Molecular Oncology, EarlyView.This schematic outlines the workflow from biomarker identification to duplex MethyLight assay validation for epithelial ovarian cancer diagnosis using cfDNA‐based liquid biopsy. Initial screening of hypermethylated CpG candidates (cg02957270, cg10061138 cg00480298, COL2A1) was performed in tissue using ARMS‐PCR, COBRA, qPCR and image analysis. Selected
Deepa Bisht +3 more
wiley +1 more source
SOME CHEMICAL TOPOLOGICAL INDICES FOR THE COPRIME GRAPH OF THE INTEGERS MODULO GROUP
BarekengThis paper delves into the exploration of the coprime graph of a finite group G, a graph with vertices representing all group elements. Vertices x and y are considered adjacent in ΓG if their orders are relatively prime.
Gustina Elfiyanti +4 more
doaj +1 more source
Molecular Oncology, EarlyView.Single‐cell multi‐omics reveals epigenetic heterogeneity across therapy‐adaptive tumor states, including quiescent/dormant, drug‐tolerant persister, and EMT‐like phenotypes. By linking regulatory features with state‐associated biomarkers, these approaches inform biomarker‐guided therapeutic strategies for evolving tumors.
Hee Jung Kim +3 more
wiley +1 more source
LexBFS-orderings and powers of chordal graphs [PDF]
, 1997 For an undirected graph G the kth power Gk of G is the graph with the same vertex set as G where two vertices are adjacent iff their distance is at most k in G.
Nicolai, Falk +2 more
core +1 more source
Randić spectrum of the weakly zero-divisor graph of the ring ℤn
AKCE International Journal of Graphs and CombinatoricsIn this article, we find the Randić spectrum of the weakly zero-divisor graph of a finite commutative ring [Formula: see text] with identity [Formula: see text], denoted as [Formula: see text], where [Formula: see text] is taken as the ring of integers ...
Nadeem Ur Rehman +3 more
doaj +1 more source
Single‐molecule DNA flow‐stretch assays for high‐throughput DNA–protein interaction studies
FEBS Open Bio, EarlyView.We describe an optimised single‐molecule DNA flow‐stretch assay that visualises DNA–protein interactions in real time. Linear DNA fragments are tethered to a surface and stretched by buffer flow for fluorescence imaging. Using λ and φX174 DNA, this protocol enhances reproducibility and accessibility, providing a versatile approach for studying diverse ...
Ayush Kumar Ganguli +8 more
wiley +1 more source
Graph partitioning by Eigenvectors [PDF]
, 1988 Let A be the adjacency matrix of a connected graph G. If z is a column vector, we say that a vertex of G is positive, nonnegative, null, etc. if the corresponding entry of z has that property.
Powers, David L.
core +1 more source
Zagreb-Type Indices of the Fractal Graphs Based on Star Graphs
AxiomsZagreb-type indices are topological indices derived from the degrees of nodes. The first Zagreb index, the F-index, and the Y-index represent the sum of the squares, cubes, and fourth powers of all node degrees, respectively.
Xintian Jia, Wenjie Wang
doaj +1 more source
The Distinguishing Number and Distinguishing Index of the Lexicographic Product of Two Graphs
Discussiones Mathematicae Graph Theory, 2018 The distinguishing number (index) D(G) (D′(G)) of a graph G is the least integer d such that G has a vertex labeling (edge labeling) with d labels that is preserved only by the trivial automorphism.
Alikhani Saeid, Soltani Samaneh
doaj +1 more source