Results 81 to 90 of about 118,378,802 (306)
Tạp chí Khoa học Đại học Đà Lạt, 2013 A regular graph is a graph where each vertex has the same degree. A regular graph with vertices of degree k is called a k -regular graph or regular graph of degree k.
Đỗ Như An, Nguyễn Đình Ái
doaj +1 more source
Maximum Reciprocal Degree Resistance Distance Index of Unicyclic Graphs
Discrete Dynamics in Nature and Society, 2020 The reciprocal degree resistance distance index of a connected graph G is defined as RDRG=∑u,v⊆VGdGu+dGv/rGu,v, where rGu,v is the resistance distance between vertices u and v in G. Let Un denote the set of unicyclic graphs with n vertices.
Gai-Xiang Cai, Xing-Xing Li, Gui-Dong Yu
doaj +1 more source
Extremal properties of distance-based graph invariants for $k$-trees [PDF]
, 2017 summary:Sharp bounds on some distance-based graph invariants of $n$-vertex $k$-trees are established in a unified approach, which may be viewed as the weighted Wiener index or weighted Harary index.
Zhang, Minjie +3 more
core +1 more source
FEBS Open Bio, EarlyView.The cytoskeleton‐mediated transport of mitochondria via tunnelling nanotubes restores respiration, increases ATP production, rescues cells from apoptosis, activates the AKT/mTOR signalling pathway, promotes cell migration and invasiveness, contributes to cancer progression and treatment resistance.
Stanislava Martínková, Jan Trnka
wiley +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
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
MagmaFlow: A desktop platform for artificial intelligence‐driven expression analysis
FEBS Open Bio, EarlyView.MagmaFlow is a free, no‐code platform for gene expression analysis. It generates interactive volcano plots, links genes to literature, pathways, and diseases, prioritizes candidates using millions of publications, identifies affected biological processes, builds network diagrams, and exports publication‐ready figures and reports for macOS and Windows ...
Carlos E. Buss +7 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
Importin 7 mediates the nuclear import of HIV‐1 integrase via a specific interacting interface
FEBS Open Bio, EarlyView.HIV‐1 integrase enables viral DNA integration into the host genome. By binding to the core domain of the host protein Importin 7 via its C‐terminal domain, the integrase is transported across the nuclear membrane into the nucleus, where integration of the viral genome into host DNA takes place. This translocation is a critical step for subsequent viral
Juana Bana +5 more
wiley +1 more source
On The Determinant of q-Distance Matrix of a Graph
Discussiones Mathematicae Graph Theory, 2014 In this note, we show how the determinant of the q-distance matrix Dq(T) of a weighted directed graph G can be expressed in terms of the corresponding determinants for the blocks of G, and thus generalize the results obtained by Graham et al.
Li Hong-Hai, Su Li, Zhang Jing
doaj +1 more source