Results 31 to 40 of about 251,114 (266)

Resistance Distance and Kirchhoff Index of the Corona-Vertex and the Corona-Edge of Subdivision Graph

open access: yesIEEE Access, 2018
The resistance distance is widely used in random walk, electronic engineering, and complex networks. One of the main topics in the study of the resistance distance is the computation problem.
Qun Liu, Jia-Bao Liu, Shaohui Wang
doaj   +1 more source

On the degree distance of a graph

open access: yesDiscrete Applied Mathematics, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Peter Dankelmann   +3 more
openaire   +1 more source

Distance in stratified graphs [PDF]

open access: yesCzechoslovak 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

The distance Seidel matrix of connected graphs

open access: yesAKCE International Journal of Graphs and Combinatorics
For a connected graph G, we present the concept of a new graph matrix related to its distance and Seidel matrix, called distance Seidel matrix [Formula: see text]. Suppose that the eigenvalues of [Formula: see text] be [Formula: see text] In this article,
T. Haritha, A. V. Chithra
doaj   +1 more source

Biophysical approaches for studying viral entry

open access: yesFEBS Letters, EarlyView.
Viruses infect all living organisms and have been responsible for major epidemics and pandemics. Their ongoing evolutionary battle with host defenses creates a constant need for improved tools to study viral behavior. Advancing methods to probe viral attachment, fusion, and genome release deepen our understanding of how infections begin and support the
Inbar Yosibash, Raya Sorkin
wiley   +1 more source

The walk distances in graphs

open access: yesDiscrete Applied Mathematics, 2012
Accepted for publication in Discrete Applied Mathematics.
openaire   +2 more sources

Distance-Regular Graphs

open access: yesThe Electronic Journal of Combinatorics, 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 monograph 'BCN' [Brouwer, A.E., Cohen, A.M., Neumaier, A., Distance-Regular Graphs, Springer-Verlag, Berlin,
Edwin R. van Dam   +2 more
openaire   +4 more sources

Septin 9 PB domains coordinate centrosome positioning and microtubule acetylation to control epithelial polarity

open access: yesFEBS Letters, EarlyView.
Septin 9 polybasic domains couple phosphoinositide‐rich membrane binding to centrosome positioning, Golgi organization, and microtubule acetylation to control epithelial polarity. Their loss disrupts this axis, causing centrosome mispositioning, Golgi fragmentation, reduced microtubule acetylation, and polarity inversion via upregulation of the ...
Ting ting Cai   +4 more
wiley   +1 more source

Rab14 regulates the transport of human papillomavirus to the trans‐Golgi network for infectious cell entry

open access: yesFEBS Letters, EarlyView.
This study reveals that the small GTPase Rab14 is necessary for human papillomavirus (HPV) infection and plays an essential role in the transport of virions to the trans‐Golgi network (TGN). HPV in the early endosome (EE), which harbors GTP‐bound Rab14, is transported to the TGN through the switch of Rab14 from its GTP‐bound to GDP‐bound form.
Yoshiyuki Ishii, Iwao Kukimoto
wiley   +1 more source

Distances in orientations of graphs

open access: yesJournal of Combinatorial Theory, Series B, 1978
We prove that there is a function h(k) such that every undirected graph G admits an orientation H with the following property: if an edge uv belongs to a cycle of length k in G, then uv or vu belongs to a directed cycle of length at most h(k) in H. Next, we show that every undirected bridgeless graph of radius r admits an orientation of radius at most $
Vasek Chvátal, Carsten Thomassen
openaire   +1 more source

Home - About - Disclaimer - Privacy