Results 101 to 110 of about 2,693,458 (344)
Novel Properties of Fuzzy Labeling Graphs
Journal of Mathematics, 2014 The concepts of fuzzy labeling and fuzzy magic labeling graph are introduced. Fuzzy magic labeling for some graphs like path, cycle, and star graph is defined. It is proved that every fuzzy magic graph is a fuzzy labeling graph, but the converse is not
A. Nagoor Gani +2 more
doaj +1 more source
α_{2}-labeling of graphs [PDF]
Opuscula Mathematica, 2009 We show that if a graph \(G\) on \(n\) edges allows certain special type of rosy labeling (a.k.a. \(\rho\)-labeling), called \(\alpha_2\)-labeling, then for any positive integer \(k\) the complete graph \(K_{2nk+1}\) can be decomposed into copies of \(G\)
Dalibor Fronček
doaj +1 more source
Shotgun Assembly of Labeled Graphs
IEEE Transactions on Network Science and Engineering, 2019 Ver3: 23 pages, matches published version but with a corrected proof of Theorem 4.5 (result unchanged); Ver2: 22 pages; Ver1: 21 ...
Elchanan Mossel, Nathan Ross
openaire +3 more sources
Molecular Oncology, EarlyView.Glioma cells mainly express the endothelin receptor EDNRB, while EDNRA is restricted to a perivascular tumor subpopulation. Endothelin signaling reduces glioma cell proliferation while promoting migration and a proneural‐to‐mesenchymal transition associated with poor prognosis. This pathway activates Ca2+, K+, ERK, and STAT3 signalings and is regulated
Donovan Pineau +36 more
wiley +1 more source
Molecular Oncology, EarlyView.We have established a humanized orthotopic patient‐derived xenograft (Hu‐oPDX) mouse model of high‐grade serous ovarian cancer (HGSOC) that recapitulates human tumor–immune interactions. Using combined anti‐PD‐L1/anti‐CD73 immunotherapy, we demonstrate the model's improved biological relevance and enhanced translational value for preclinical ...
Luka Tandaric +10 more
wiley +1 more source
AKCE International Journal of Graphs and Combinatorics, 2018 A graph G = ( V , E ) , where | V | = n and | E | = m is said to be a distance magic graph if there exists a bijection from the vertex set V to the set { 1 , 2 , … , n } such that, ∑ v ∈ N ( u ) f ( v ) = k , for all u ∈ V , which is a constant and ...
Aloysius Godinho, T. Singh
doaj +2 more sources
Total Face Irregularity Strength of Grid and Wheel Graph under K-Labeling of Type (1, 1, 0)
Journal of Mathematics, 2021 In this study, we used grids and wheel graphs G=V,E,F, which are simple, finite, plane, and undirected graphs with V as the vertex set, E as the edge set, and F as the face set.
Aleem Mughal, Noshad Jamil
doaj +1 more source
Applied Mathematics and Computation, 2019 It is well known that the labeling problems of graphs arise in many (but not limited to) networking and telecommunication contexts. In this paper we introduce the anti-$k$-labeling problem of graphs which we seek to minimize the similarity (or distance) of neighboring nodes.
Xiaxia Guan +4 more
openaire +3 more sources
CCDC80 suppresses high‐grade serous ovarian cancer migration via negative regulation of B7‐H3
Molecular Oncology, EarlyView.PAX8 is a lineage‐specific master regulator of transcription in high‐grade serous ovarian cancer (HGSC) progression. We show for the first time that PAX8 facilitates proliferation and metastasis by repressing the cell autonomous tumor suppressor CCDC80 and inducing B7‐H3 expression.
Aya Saleh +12 more
wiley +1 more source
ON PRIME LABELING OF THETA GRAPH [PDF]
, 2016 A graph with vertex set is said to have a prime labeling if its vertices are labeled with distinct integers such that for each edge the labels assigned to and are relatively prime. A graph which admits prime labeling is called a prime graph.
Dr. K. Balamurugan, V. Ganesan
core +1 more source