Results 41 to 50 of about 86,172 (263)

Regular $K_3$-regular graphs

open access: yesCoRR
We study graphs that are simultaneously regular with respect to the ordinary vertex degree and regular with respect to the triangle degree, that is, the number of triangles containing a given vertex. We call such graphs regular $K_3$-regular. We investigate the (non-)existence of regular $K_3$-regular graphs with prescribed parameters $(r_2,r_3 ...
Artem Hak   +3 more
openaire   +2 more sources

Transferrin receptor 1‐mediated iron uptake supports thermogenic activation in human cervical‐derived adipocytes

open access: yesFEBS Letters, EarlyView.
In this study, we found that human cervical‐derived adipocytes maintain intracellular iron level by regulating the expression of iron transport‐related proteins during adrenergic stimulation. Melanotransferrin is predicted to interact with transferrin receptor 1 based on in silico analysis.
Rahaf Alrifai   +9 more
wiley   +1 more source

Non-Isolated Resolving Sets of Corona Graphs with Some Regular Graphs

open access: yesMathematics, 2022
Let G be a connected, simple, and finite graph. For an ordered set W={w1,w2,…,wk}⊆V(G) and a vertex v of G, the representation of v with respect to W is the k-vector r(v|W)=(dG(v,w1),…,dG(v,wk)).
Wahyuni Abidin   +2 more
doaj   +1 more source

On extension of regular graphs [PDF]

open access: yesJournal of Discrete Mathematical Sciences and Cryptography, 2018
arXiv admin note: substantial text overlap with arXiv:1407 ...
Banerjee, Anirban, Bej, Saptarshi
openaire   +2 more sources

Hyperosmotic stress induces PARP1‐mediated HPF1‐dependent mono(ADP‐ribosyl)ation

open access: yesFEBS Letters, EarlyView.
Sorbitol‐induced hyperosmotic stress rapidly induces reversible mono(ADP‐ribosyl)ation (MARylation) on PARP1 without the signs of genotoxic signaling. We show that PARP1 autoMARylation is HPF1 dependent and forms hydroxylamine‐resistant O‐glycosidic linkages.
Anna Georgina Kopasz   +11 more
wiley   +1 more source

Introduction to Topological Indices in Neutrosophic Graphs [PDF]

open access: yesNeutrosophic Sets and Systems, 2020
Neutrosophic Graphs are graphs that follow three-valued logic. They may be considered a fuzzy graph, although in some cases, it is difficult to optimize and model them using fuzzy graphs. In this paper, the first and second Zagreb indices, the Harmonic
Masoud Ghods, Zahra Rostami
doaj   +1 more source

Regular embeddings of a graph [PDF]

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

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

Some Results on Pendant Regular Graphs

open access: yesPan-American Journal of Mathematics, 2023
Let G = (V, E) be a simple connected graph with o(G) = n and s(G) = m. A graph with pendant vertices is called Pendant Graphs or simply P-Graphs. In this paper we define the regularity of Pendant Graphs w.r.t.
Suji Elizabeth Mathew   +1 more
doaj   +1 more source

Home - About - Disclaimer - Privacy