Results 101 to 110 of about 9,407,399 (300)
On estimation of extremal entries of the principal eigenvector of a graph
AKCE International Journal of Graphs and CombinatoricsLet [Formula: see text] be the principal eigenvector corresponding to the spectral radius [Formula: see text] of a graph G of order n. In this paper, we find some bounds on the ratio of the maximal component [Formula: see text] to the minimal component ...
Prohelika Das, Bipanchy Buzarbarua
doaj +1 more source
Bounds on the 2-domination number in cactus graphs [PDF]
Opuscula Mathematica, 2006 A \(2\)-dominating set of a graph \(G\) is a set \(D\) of vertices of \(G\) such that every vertex not in \(S\) is dominated at least twice. The minimum cardinality of a \(2\)-dominating set of \(G\) is the \(2\)-domination number \(\gamma_{2}(G)\).
Mustapha Chellali
doaj
Central bank independence and inflation revisited [PDF]
, 2010 Central bank independence, Heterogeneous panel model, Inflation, Monetary institutions, Turnover of central bank governors, E58,
de Haan, Jakob +7 more
core +2 more sources
Biophysical approaches for studying viral entry
FEBS 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
Power graphs and a combinatorial property of abundant semigroups
AKCE International Journal of Graphs and CombinatoricsThe aim of this paper is to study the power graph of a semigroup. We obtain sufficient and necessary conditions for the independence number of the power graph of an (IC) abundant semigroups (superabundant semigroups) to be finite.
Junying Guo, Xiaojiang Guo
doaj +1 more source
A dynamic domination problem in trees [PDF]
Transactions on Combinatorics, 2015 We consider a dynamic domination problem for graphs in which an infinite sequence of attacks occur at vertices with guards and the guard at the attacked vertex is required to vacate the vertex by moving to a neighboring vertex with no guard. Other guards
William Klostermeyer, Christina Mynhardt
doaj
Independence : Subdivision code
, 2001 325 pp. Bookmarks supplied by UO. Referenced maps not included. Published December 13, 2001, per website. Captured November 8, 2006.Development codes are ordinances implementing a local government’s comprehensive plan.
Independence (Or.)
core +1 more source
Racing algorithms for conditional independence inference [PDF]
, 2007 In this article, we consider the computational aspects of deciding whether a conditional independence statement t is implied by a list of conditional independence statements L using the independence implication provided by the method of structural imsets.
Studený, Milan, Bouckaert, Remco R.
core +1 more source
FEBS 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
FEBS 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