Results 61 to 70 of about 782,126 (230)
Exhaustive Enumeration of Spatial Prime Structures
Prime structures are link chains with 0 DoF (degrees of freedom), not including subchains with 0 or fewer DoF, which are expected to be used in systematic kinematic and dynamic analyses of link mechanisms.
Takahiro Aruga, Nobuyuki Iwatsuki
doaj +1 more source
Dominating sets and domination polynomials of certain graphs, II [PDF]
The domination polynomial of a graph \(G\) of order \(n\) is the polynomial \(D(G,x) = \sum _{i=\gamma(G)}^n d(G,i)x^i\), where \(d(G,i)\) is the number of dominating sets of \(G\) of size \(i\), and \(\gamma (G)\) is the domination number of \(G\).
Saeid Alikhani, Yee-hock Peng
doaj +1 more source
Relatively Prime Detour Domination Number of Switching Certain Special Graphs
A set S ⊆ V is said to be a relatively prime detour dominating set of a graph G if it has at least two members is a detour set and a dominating set for any pair of vertices b and w such that (deg(b), deg(w)) = 1.
C. Jayasekaran, L. G. Binoja
doaj +1 more source
Prime vertex-minors of a prime graph
33 pages, 11 figures.
Donggyu Kim, Sang-il Oum
openaire +3 more sources
Prime and Odd Prime Labelings on Cycle-Related Graphs
Graph labeling is the process of determining integer values for vertices, edges, or both, based on certain criteria. Let G be a simple graph with the finite vertex set V(G). Prime labeling of G is a bijection ⍺:V(G)→{1,2,…,|V(G)|} for which each pair of
Hafif Komarullah +3 more
doaj +1 more source
A new characterization of the automorphism groups of Mathieu groups
Let cd(G){\rm{cd}}\left(G) be the set of irreducible complex character degrees of a finite group GG. ρ(G)\rho \left(G) denotes the set of primes dividing degrees in cd(G){\rm{cd}}\left(G).
Liu Xin, Chen Guiyun, Yan Yanxiong
doaj +1 more source
Determination of the prime bound of a graph
Given a graph G, a subset M of V(G) is a module of G if for each v∈V(G)∖M, v is adjacent to all the elements of M or adjacent to none of them. For instance, V(G), ∅ and {v} (v∈V(G)) are modules of G called trivial. Given a graph G, ωM(G) (respectively αM(G)) denotes the largest integer m such that there is a module M of G which is a clique ...
Ille, Pierre, Boussaïri, Abderrahim
openaire +4 more sources
An isoform of 14‐3‐3 protein regulates transbilayer lipid movement at the plasma membrane
Loss of 14‐3‐3ζ in CHO cells confers resistance to exogenous phosphatidylserine (PS) and impairs endocytosis‐independent inward flip‐flop of fluorescent PS at the plasma membrane. RNAi‐mediated knockdown reproduces this defect, while no additive effect is seen in ATP11C‐deficient cells.
Akiko Yamaji‐Hasegawa +3 more
wiley +1 more source
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
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

