Results 41 to 50 of about 832,958 (281)
Linear rank-width of distance-hereditary graphs II. Vertex-minor obstructions
, 2017 In the companion paper [Linear rank-width of distance-hereditary graphs I. A polynomial-time algorithm, Algorithmica 78(1):342--377, 2017], we presented a characterization of the linear rank-width of distance-hereditary graphs, from which we derived an ...
Kanté, Mamadou Moustapha, Kwon, O-joung
core +3 more sources
Graph Domination in Distance Two
Discussiones Mathematicae Graph Theory, 2005 A subgraph \(D\) of a graph \(G\) is \(k\)-dominating in \(G\) if every vertex of \(G-D\) is of distance \(\leq k\) from a vertex of \(D\). If \(\mathcal D\) is a specified class of graphs, Dom\(_k \mathcal D\) consists of all those graphs \(G\) in which every connected induced subgraph \(H\) has a \(k\)-dominating induced subgraph \(D \in {\mathcal D}\
Bacsó, Gábor +2 more
openaire +2 more sources
On the metric dimension of imprimitive distance-regular graphs
, 2016 A resolving set for a graph $\Gamma$ is a collection of vertices $S$, chosen so that for each vertex $v$, the list of distances from $v$ to the members of $S$ uniquely specifies $v$.
Bailey, Robert F.
core +1 more source
Molecular Oncology, EarlyView.A comprehensive genomic and proteomic analysis of cervical cancer revealed STK11 and STX3 as a potential biomarkers of chemoradiation resistance. Our study demonstrated EGFR as a therapeutic target, paving the way for precision strategies to overcome treatment failure and the DNA repair pathway as a critical mechanism of resistance.
Janani Sambath +13 more
wiley +1 more source
Some new results on the reciprocal complementary Wiener number of graphs [PDF]
Contributions to Mathematics, 2022 Ramin Nasiri, Ali Reza Shojaeifard
doaj +1 more source
On Automorphisms of a Distance-Regular Graph with Intersection Array {125,96,1;1,48,125} [PDF]
Учёные записки Казанского университета: Серия Физико-математические науки, 2017 J. Koolen posed the problem of studying distance-regular graphs in which neighborhoods of vertices are strongly regular graphs with the second eigenvalue ≤ t for the given positive integer t.
V.V. Bitkina, A.A. Makhnev
doaj
, 2016 This is a survey of distance-regular graphs. We present an introduction to distance-regular graphs for the reader who is unfamiliar with the subject, and then give an overview of some developments in the area of distance-regular graphs since the ...
Koolen, Jack H. +2 more
core +2 more sources
Distance independence in graphs
Discussiones Mathematicae Graph Theory, 2011 For a set D of positive integers, we define a vertex set SV (G) to be D-independent if u,v 2 S implies the distance d(u,v) 㘲 D. The D-independence numberD(G) is the maximum cardinality of a D-independent set. In particular, the independence number (G) = {1}(G).
J.Louis Sewell, Peter J. Slater
openaire +1 more source
Strong sum distance in fuzzy graphs [PDF]
SpringerPlus, 2015 In this paper the idea of strong sum distance which is a metric, in a fuzzy graph is introduced. Based on this metric the concepts of eccentricity, radius, diameter, center and self centered fuzzy graphs are studied. Some properties of eccentric nodes, peripheral nodes and central nodes are obtained.
Tom, Mini, Sunitha, Muraleedharan Shetty
openaire +2 more sources
Emerging role of ARHGAP29 in melanoma cell phenotype switching
Molecular Oncology, EarlyView.This study gives first insights into the role of ARHGAP29 in malignant melanoma. ARHGAP29 was revealed to be connected to tumor cell plasticity, promoting a mesenchymal‐like, invasive phenotype and driving tumor progression. Further, it modulates cell spreading by influencing RhoA/ROCK signaling and affects SMAD2 activity. Rho GTPase‐activating protein
Beatrice Charlotte Tröster +3 more
wiley +1 more source