Results 61 to 70 of about 2,938,351 (247)
On the set chromatic number of the join and comb product of graphs [PDF]
, 2020 A vertex coloring c : V(G) → of a non-trivial connected graph G is called a set coloring if NC(u) ≠ NC(v) for any pair of adjacent vertices u and v. Here, NC(x) denotes the set of colors assigned to vertices adjacent to x. The set chromatic number of G,
Garciano, Agnes +2 more
core +1 more source
Super edge-magic labeling of graphs: deficiency and maximality
Electronic Journal of Graph Theory and Applications, 2017 A graph G of order p and size q is called super edge-magic if there exists a bijective function f from V(G) U E(G) to {1, 2, 3, ..., p+q} such that f(x) + f(xy) + f(y) is a constant for every edge $xy \in E(G)$ and f(V(G)) = {1, 2, 3, ..., p}.
Anak Agung Gede Ngurah +1 more
doaj +1 more source
PLoS ONE, 2021 Low adherence in vaginal microbicide clinical trials for HIV prevention has impeded interpretation of trial results and hindered evaluation of potentially efficacious HIV prevention gels.
Lori Miller +4 more
doaj +1 more source
Unlocking the potential of cell‐permeable nanobodies for intracellular applications
FEBS Letters, EarlyView.This review outlines current strategies for delivery of nanobodies into cells and highlights recent examples of functional applications. By addressing and manipulating intracellular targets, these molecules hold great potential for treating cancer, respiratory diseases and neurological disorders, making this a vibrant area of research in the biomedical
Mariona Gené‐Verdés +2 more
wiley +1 more source
Algebraic Structure of Graph Operations in Terms of Degree Sequences
International Journal of Analysis and Applications, 2018 In this paper, by means of the degree sequences (DS) of graphs and some graph theoretical and combinatorial methods, we determine the algebraic structure of the set of simple connected graphs according to two graph operations, namely join and Corona ...
Vishnu Narayan Mishra +2 more
doaj +2 more sources
On the super edge-magic deficiency of join product and chain graphs
Electronic Journal of Graph Theory and Applications, 2019 A graph G of order ∣V(G)∣ = p and size ∣E(G)∣ = q is called super edge-magic if there exists a bijection f : V(G) ∪ E(G) → {1, 2, 3, ⋯, p + q} such that f(x) + f(xy) + f(y) is a constant for every edge xy ∈ E(G) and f(V(G)) = {1, 2, 3, ⋯, p}. Furthermore,
Anak Agung Gede Ngurah +1 more
doaj +1 more source
Tumour–host interactions in Drosophila: mechanisms in the tumour micro‐ and macroenvironment
Molecular Oncology, EarlyView.This review examines how tumour–host crosstalk takes place at multiple levels of biological organisation, from local cell competition and immune crosstalk to organism‐wide metabolic and physiological collapse. Here, we integrate findings from Drosophila melanogaster studies that reveal conserved mechanisms through which tumours hijack host systems to ...
José Teles‐Reis, Tor Erik Rusten
wiley +1 more source
Local edge antimagic chromatic number of join product of graphs
Indonesian Journal of CombinatoricsLet f : V(G) \to [1,|V(G)|] be a bijective mapping of the vertex set of a graph G to the integers 1 through |V(G)|. A labeling f is defined as a local edge antimagic labeling if, for any two adjacent edges uv and vx in E(G), their weights satisfy wf(uv) ≠
Tita Khalis Maryati +1 more
doaj +1 more source
Molecular Oncology, EarlyView.In this explorative study, the abundance of circular RNA molecules in bone marrow stem cells was found to be elevated in patients with high‐risk myelodysplastic neoplasms, and to be associated with an increased risk of progression to acute myeloid leukemia.
Eileen Wedge +17 more
wiley +1 more source
International Journal of Mathematics for IndustryThis paper explores operations on fuzzy incidence graphs (FIGs), focusing on join, Cartesian product, tensor product, and composition. Emphasizing strong fuzzy incidence graphs (SFIGs), the study examines strong incidence domination (SID) and the strong ...
Kavya R. Nair, M. S. Sunitha
doaj +1 more source