Results 41 to 50 of about 2,253,480 (276)
Total Rainbow Connection Number of Some Graph Operations
Axioms, 2022 In a graph H with a total coloring, a path Q is a total rainbow if all elements in V(Q)∪E(Q), except for its end vertices, are assigned different colors. The total coloring of a graph H is a total rainbow connected coloring if, for any x,y∈V(H), there is
Hengzhe Li, Yingbin Ma, Yan Zhao
doaj +1 more source
Therapeutic Apheresis and Dialysis, EarlyView.ABSTRACT Secondary hyperparathyroidism (SHPT) is a common complication in patients receiving maintenance dialysis, driven by calcium and phosphate metabolism disturbances. Calcimimetics are central to the management of SHPT by enhancing calcium‐sensing receptor sensitivity and reducing parathyroid hormone secretion.
Fumihiko Koiwa +3 more
wiley +1 more source
Total Product and Total Edge Product Cordial Labelings of Dragonfly Graph Dgn
Journal of Mathematics, 2022 In this paper, we study the total product and total edge product cordial labeling for dragonfly graph Dgn. We also define generalized dragonfly graph and find product cordial and total product cordial labeling for this family of graphs.
N. Inayah, A. Erfanian, M. Korivand
doaj +1 more source
FEBS Letters, EarlyView.Enteropathogenic E. coli (EPEC) infects the human intestinal epithelium, resulting in severe illness and diarrhoea. In this study, we compared the infection of cancer‐derived cell lines with human organoid‐derived models of the small intestine. We observed a delayed in attachment, inflammation and cell death on primary cells, indicating that host ...
Mastura Neyazi +5 more
wiley +1 more source
Algorithm for Constructing Total Graph of Commutative Ring
JTAM (Jurnal Teori dan Aplikasi Matematika)Let R be a commutative ring. The total graph of R, denoted by TΓ(R) is a graph whose vertices are all elements of the ring R and every i,j∈R with i≠j, then i and j vertices are connected by edges if and only if i+j∈Z(R), where Z(R) is the set of zero ...
Rima Meinawati +2 more
doaj +1 more source
Discrete Mathematics, 1997 Let \(G=(V,E)\) be a connected graph. The elements of the set \(V(G)\cup E(G)\) are called elements of \(G\). A set \(M\) of elements of \(G\) is called a total matching if the elements of \(M\) are pairwise independent, and \(G\) is totally equimatchable if every maximal total matching of \(G\) is maximum.
Topp, Jerzy, Vestergaard, Preben D.
openaire +3 more sources
Total Colourings of Direct Product Graphs
, 2019 A graph is k-total colourable if there is an assignment of k different colours to the vertices and edges of the graph such that no two adjacent nor incident elements receive the same colour.
Janssen, Jeannette, MacKeigan, Kyle
core +1 more source
Crosstalk between the ribosome quality control‐associated E3 ubiquitin ligases LTN1 and RNF10
FEBS Letters, EarlyView.Loss of the E3 ligase LTN1, the ubiquitin‐like modifier UFM1, or the deubiquitinating enzyme UFSP2 disrupts endoplasmic reticulum–ribosome quality control (ER‐RQC), a pathway that removes stalled ribosomes and faulty proteins. This disruption may trigger a compensatory response to ER‐RQC defects, including increased expression of the E3 ligase RNF10 ...
Yuxi Huang +8 more
wiley +1 more source
Discrete Mathematics, 2002 A one-to-one mapping \(V\cup E \rightarrow \{1, 2, \ldots, |V|+|E|\}\) is vertex magic, if each vertex has the same sum of its label and the labels of its incident edges, and is edge magic if each edge has the same sum of its label and the labels of its endpoints.
Exoo, Geoffrey +4 more
openaire +1 more source
Complexity of colouring problems restricted to unichord-free and \{square,unichord\}-free graphs
, 2013 A \emph{unichord} in a graph is an edge that is the unique chord of a cycle. A \emph{square} is an induced cycle on four vertices. A graph is \emph{unichord-free} if none of its edges is a unichord.
de Figueiredo, Celina M. H. +2 more
core +3 more sources