Results 51 to 60 of about 119,419 (266)
Discussiones Mathematicae Graph Theory, 2016 We show that every 3-regular circle graph has at least two pairs of twin vertices; consequently no such graph is prime with respect to the split decomposition.
Traldi Lorenzo
doaj +1 more source
Regular embeddings of a graph [PDF]
Pacific Journal of Mathematics, 1983 In this paper we study embeddings of a graph G in Euclidean space R" that are 'regular' in the following sense: given any two distinct vertices u and v of G, the distance between the corresponding points in R" equals a if u and v are adjacent, and equals β otherwise.
openaire +3 more sources
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
Generation of strongly regular graphs from quaternary complex Hadamard matrices
Ceylon Journal of Science, 2018 A strongly regular graph with parameters (v, k, μ, λ) is a regular graph G with v vertices and k degree in which every two adjacent vertices have λ common neighbors and every two non-adjacent vertices have μ common neighbors. In this paper, we propose an
W. V. Nishadi +3 more
doaj +1 more source
Factorizations of regular graphs
Journal of Combinatorial Theory, Series B, 1992 Let G be a k-regular graph of order 2n such that \(k\geq n\). \textit{A. J. W. Hilton} [J. Graph Theory 9, 193-196 (1985; Zbl 0624.05050)] proved that G contains at least \(\lfloor k/3\rfloor\) edge-disjoint 1-factors. Hilton's theorem is improved in this paper that G contains at least \(\lfloor k/2\rfloor\) edge-disjoint 1-factors.
Cun-Quan Zhang, Yongjin Zhu
openaire +2 more sources
FEBS Letters, EarlyView.An unexpected alternative interaction site for ethyl viologen was identified in formate dehydrogenase 1 from Methylorubrum extorquens. Combined mutagenesis, kinetic analysis, and docking revealed that aromatic residues near an iron–sulfur cluster enable flavin mononucleotide‐independent electron transfer, offering a framework for engineering improved ...
Eleni G. Poloniataki, Yong Hwan Kim
wiley +1 more source
Molecular Oncology, EarlyView.Aptamers are used both therapeutically and as targeting agents in cancer treatment. We developed an aptamer‐targeted PLGA–TRAIL nanosystem that exhibited superior therapeutic efficacy in NOD/SCID breast cancer models. This nanosystem represents a novel biotechnological drug candidate for suppressing resistance development in breast cancer.
Gulen Melike Demirbolat +8 more
wiley +1 more source
On Sombor indices of generalized tensor product of graph families
Results in Control and OptimizationGraph invariants are extensively being used in different fields for analysing the structural properties of different compounds. Several topological indices, their properties and relations between different indices have been explored. Ivan Gutman recently
Nadar Jenita Mary Masilamani Raja +1 more
doaj +1 more source
Families of Regular Graphs in Regular Maps
Journal of Combinatorial Theory, Series B, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources