Results 61 to 70 of about 1,430 (216)
Distance-Regular Graphs and Halved Graphs
European Journal of Combinatorics, 1986 Let G be a bipartite distance-regular graph with bipartition \(V(G)=X\cup Y\). Let \(V(G')=X\) and, for x and y in X, let x be adjacent to y in G' if and only if x is of distance two from y in G. Then G' is called a halved graph of G, and is distance-regular. This paper discusses whether G' is one of the known, large-diameter, distance-regular graphs.
openaire +3 more sources
On the rotation distance of graphs
Discrete Mathematics, 1994 Let \(G\) be a simple undirected graph and suppose that \((x,y)\in E(G)\) and \((x,y')\not\in E(G)\). Then the rotation of \((x,y)\) about \(x\), denoted by \(r= (y,x,y')\) is the operation of removing \((x,y)\) and inserting \((x,y')\) as an edge. The resulting graph is denoted by \(G(r)\). A graph \(G\) can be rotated into a graph \(H\) if there is a
Ralph J. Faudree +4 more
openaire +2 more sources
Distance in stratified graphs [PDF]
Czechoslovak Mathematical Journal, 2000 A stratified graph is an ordered pair \((G,S)\), where \(G\) is an undirected graph and \(S\) is a partition of its vertex set \(V(G)\) into classes called strata. For any stratum \(X\) the concepts analogous to the basic concepts concerning distance may be defined, namely \(X\)-eccentricity, \(X\)-radius, \(X\)-diameter, \(X\)-center, \(X\)-periphery.
Chartrand, Gary +3 more
openaire +1 more source
Molecular Oncology, EarlyView.LVRF (lymphatic and vascular resistance factor) is a VEGFA splice variant upregulated in response to anti‐angiogenic therapy that fosters tumor adaptation through enhanced vascularization, lymphangiogenesis, and metastatic dissemination. Targeting LVRF with fully human neutralizing antibodies disrupts these processes and limits resistant tumor growth ...
Marion David +12 more
wiley +1 more source
Journal of Combinatorial Theory, Series B, 1986 A distance-hereditary graph is a connected graph in which every induced path is isometric, that is, the distance between any two vertices in an induced path equals their distance in the graph. A block graph is a conncted graph in which every block (i.e., maximal 2-connected subgraph) is complete. Let G be a graph with distance function d.
Hans-Jürgen Bandelt +1 more
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
On Wiener index of graph complements [PDF]
Transactions on Combinatorics, 2014 Let $G$ be an $(n,m)$-graph. We say that $G$ has property $(ast)$ if for every pair of its adjacent vertices $x$ and $y$, there exists a vertex $z$, such that $z$ is not adjacent to either $x$ or $y$.
Jaisankar Senbagamalar +2 more
doaj
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
The relationship between the intrinsic Čech and persistence distortion distances for metric graphs
Journal of Computational Geometry, 2019 Metric graphs are meaningful objects for modeling complex structures that arise in many real-world applications, such as road networks, river systems, earthquake faults, blood vessels, and filamentary structures in galaxies.
Ellen Gasparovic +6 more
doaj +1 more source
European Journal of Combinatorics, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Aleksandar Ilic +2 more
openaire +2 more sources