Results 31 to 40 of about 427 (193)
Vertex-Magic Total Labeling on G-sun Graphs [PDF]
, 2022 Graph labeling is an immense area of research in mathematics, specifically graph theory. There are many types of graph labelings such as harmonious, magic, and lucky labelings. This paper will focus on magic labelings. Graph theorists are particularly
Mejia, Melissa
core +1 more source
On cordial labeling of hypertrees
, 2019 Let $f:V\rightarrow\mathbb{Z}_k$ be a vertex labeling of a hypergraph $H=(V,E)$. This labeling induces an~edge labeling of $H$ defined by $f(e)=\sum_{v\in e}f(v)$, where the sum is taken modulo $k$.
Tuczyński, Michał +2 more
core +1 more source
ODD HARMONIOUS LABELINGS OF CYCLIC SNAKES
, 2021 In [8] Liang and Bai have shown that the kC4 − snake graph is an odd harmonious graph for each k ≥ 1. In this paper we generalize this result on cycles by showing that the kCn − snake with string 1,1,…,1 when n ≡ 0 (mod 4) are odd harmonious graph.
openaire +1 more source
Odd harmonious labeling of super subdivisión graphs [PDF]
Proyecciones (Antofagasta), 2019 A graph G(p, q) is said to be odd harmonious if there exists an injection ?: V (G) → {0, 1, 2, · · · , 2q − 1} such that the induced function ?∗: E(G) → {1, 3, · · · , 2q − 1} defined by ?∗(uv) = ? (u) + ? (v) is a bijection. In this paper we prove that super subdivision of any cycle Cm with m ≥ 3 ,ladder, cycle Cn for n ≡ 0(mod 4) with K1,m and ...
P. Jeyanthi, S. Philo, M. K. Siddiqui
openaire +2 more sources
Roman Domination in Complementary Prism Graphs [PDF]
, 2012 A Roman domination function on a complementary prism graph GGc is a function f : V [ V c ! {0, 1, 2} such that every vertex with label 0 has a neighbor with label 2. The Roman domination number R(GGc) of a graph G = (V,E) is the minimum of Px2V [V c f(x)
Chaitra, V., Chaluvaraju, B.
core +2 more sources
Absolutely Harmonious Labeling Of Graphs
, 2011 In this paper, we obtain necessary conditions for a graph to be absolutely harmonious and study absolutely harmonious behavior of certain classes of graphs.
Seenivasan, M., Lourdusamy, A.
openaire +1 more source
Therapeutic Apheresis and Dialysis, EarlyView.ABSTRACT Objective To compare the efficacy and safety of roxarestat versus recombinant human erythropoietin (rhEPO) in the management of renal anemia in patients undergoing maintenance hemodialysis. Methods This was a prospective, open‐label, randomized controlled trial.
Lingling Chen, Junjie Zhu, Qiaonan Ge
wiley +1 more source
, 2021 In graph theory, a graph labeling is an assignment of labels to the edges and vertices of a graph. There are many different types of graphs labelings. Some include graceful labelings, harmonious labelings, and magic labelings.
Massud, Karissa L.
core +1 more source
The newfound relationship between extrachromosomal DNAs and excised signal circles
FEBS Letters, EarlyView.Extrachromosomal DNAs (ecDNAs) contribute to the progression of many human cancers. In addition, circular DNA by‐products of V(D)J recombination, excised signal circles (ESCs), have roles in cancer progression but have largely been overlooked. In this Review, we explore the roles of ecDNAs and ESCs in cancer development, and highlight why these ...
Dylan Casey, Zeqian Gao, Joan Boyes
wiley +1 more source
An Algorithm for Odd Graceful Labeling of the Union of Paths and Cycles
, 2010 In 1991, Gnanajothi [4] proved that the path graph P_n with n vertex and n-1 edge is odd graceful, and the cycle graph C_m with m vertex and m edges is odd graceful if and only if m even, she proved the cycle graph is not graceful if m odd. In this paper,
Moussa, M. Ibrahim
core +2 more sources