Results 91 to 100 of about 2,418,413 (302)
Graph Clustering Using Distance-k Cliques
, 1999 Identifying the natural clusters of nodes in a graph and treating them as supernodes or metanodes for a higher level graph (or an abstract graph) is a technique used for the reduction of visual complexity of graphs with a large number of nodes.
Brandenburg, Franz J. +5 more
core +1 more source
On the distance eigenvalues of Cayley graphs
پژوهشهای ریاضی, 2022 In this paper, graphs are undirected and loop-free and groups are finite. By Cn, Kn and Km,n we mean the cycle graph with n vertices, the complete graph with n vertices and the complete bipartite graph with parts size m and n, respectively.
Majid Arezoomand
doaj
Molecular Oncology, EarlyView.Tumour heterogeneity and clonal evolution of metastatic salivary gland cancer were evaluated in two patients with adenoid carcinoma and one patient with myoepithelial carcinoma. Radiology‐guided autopsy enabled multi‐region sampling (total samples n = 149), followed by whole‐genome sequencing and phylogenetic reconstruction (17 tumour samples, 4–7 per ...
Gerben Lassche +10 more
wiley +1 more source
FEBS Open Bio, EarlyView.Time‐resolved X‐ray solution scattering captures how proteins change shape in real time under near‐native conditions. This article presents a practical workflow for light‐triggered TR‐XSS experiments, from data collection to structural refinement. Using a calcium‐transporting membrane protein as an example, the approach can be broadly applied to study ...
Fatemeh Sabzian‐Molaei +3 more
wiley +1 more source
SSDE: Fast Graph Drawing Using Sampled Spectral Distance Embedding
, 2006 We present a fast spectral graph drawing algorithm for drawing undirected connected graphs. Classical Multi-Dimensional Scaling yields a quadratictime spectral algorithm, which approximates the real distances of the nodes in the final drawing with their ...
Civril, Ali +5 more
core +1 more source
Répertoire de l'enseignement à distance en français
, 1994 1994 /Titre de la ...
Réseau d'enseignement francophone à distance
core +1 more source
Non-Inclusive and Inclusive Distance Irregularity Strength of Complement and Split Graphs
Science and Technology IndonesiaLet $f$ be a map from vertices of a graph $G$ to number from $1$ to $k$. The labeling $f$ is called distance irregular if for every two vertices $x$ and $y$, it holds that $wt_f(u) \ne wt_f(v)$ where a weight $wt_f(u)$ is defined as the sum of labels of
Tita Khalis Maryati, Fawwaz Fakhrurrozi
doaj +1 more source
Distance antimagic labeling of join and corona of two graphs
AKCE International Journal of Graphs and Combinatorics, 2017 Let be a graph of order . Let be a bijection. The weight of a vertex with respect to is defined by , where is the open neighborhood of . The labeling is said to be distance antimagic if for every pair of distinct vertices .
A.K. Handa +3 more
doaj +1 more source
Distance perfectness of graphs
Discussiones Mathematicae Graph Theory, 1999 The author introduces a new generalization of perfect graphs. It turns out that the analogue of the weak perfect graph theorem is not true for this generalization. A subset \(Q\) of the vertex set \(V\) of a graph \(G\) is a \(k\)-distance clique in \(G\) if \(d_G(x,y)\leq k\) for any \(x,y\in Q\) and \(\langle Q\rangle_G\), the subgraph of \(G ...
openaire +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