نتایج جستجو برای: totally magic cordial labeling

تعداد نتایج: 96935  

Journal: :Malaya Journal of Matematik 2019

Journal: :European Journal of Mathematics and Statistics 2023

Let an injective function f from vertex set V of a graph G to the (F0, F1, F2, ..., Fn), where Fj is jth Fibonacci number (j=0, 1, n), said be cordial labeling if induced f* edge E {0,1} defined by (uv) = (f(u)+f(v)) (mod2) satisfies condition |ef(0)- ef(1) ≤ ef(0) edges with label 0 and 1. A which admits called graph.

2010
S. Arumugam Dalibor Froncek N. Kamatchi

Let G = (V,E) be a graph of order n. A bijection f : V → {1, 2, . . . , n} is called a distance magic labeling of G if there exists a positive integer k such that ∑ u∈N(v) f(u) = k for all v ∈ V, where N(v) is the open neighborhood of v. The constant k is called the magic constant of the labeling f . Any graph which admits a distance magic labeling is called a distance magic graph. In this pape...

2008
EBRAHIM SALEHI

A graph G is said to be A-magic if there is a labeling l : E(G) −→ A − {0} such that for each vertex v, the sum of the labels of the edges incident with v are all equal to the same constant; that is, l+(v) = c for some fixed c ∈ A. In general, a graph G may admit more than one labeling to become A-magic; for example, if |A| > 2 and l : E(G) −→ A − {0} is a magic labeling of G with sum c, then l...

2008
Ebrahim Salehi

Given an abelian group A, a graph G = (V, E) is said to have a distance two magic labeling in A if there exists a labeling l : E(G) → A − {0} such that the induced vertex labeling l∗ : V (G) → A defined by l∗(v) = ∑ e∈E(v) l(e) is a constant map, where E(v) = {e ∈ E(G) : d(v, e) < 2}. The set of all h ∈ Z+ for which G has a distance two magic labeling in Zh is called the distance two magic spec...

2014
A.Nagoor Gani

The concept of fuzzy magic labeling is introduced.Fuzzy magic labeling for some graphs like path, cycle and star graph are defined. It is proved that, every fuzzy magic graph is a fuzzy labeling graph, but the converse is not true. And we show that the removal of a fuzzy bridge from a fuzzy magic graph G, such that G* is a cycle with odd number of nodes is a fuzzy magic graph.And also some prop...

2014
Muhammad Imran Mehar Ali Malik M. Yasir Hayat Malik

ON SUPER EDGE-MAGIC TOTAL LABELING OF REFLEXIVE W-TREES Muhammad Imran, Mehar Ali Malik, M. Yasir Hayat Malik Department of Mathematics, School of Natural Sciences (SNS), National University of Sciences and Technology (NUST), Islamabad, Pakistan. E-mail: {imrandhab, alies.camp, yasirmalikawan}@gmail.com Mathematics Subject Classification: 05C78 ABSTRACT. Kotzig and Rosa [17] defined a magic lab...

Journal: :Australasian J. Combinatorics 2009
Wai Chee Shiu Richard M. Low

Z k-magic labelings of fans and wheels with magic-value zero Abstract Let A be a non-trivial abelian group and A * = A − {0}. A graph is A-magic if there exists an edge labeling using elements of A * which induces a constant vertex labeling of the graph. For fan graphs F n and wheel graphs W n , we determine the sets of numbers k ∈ N, where F n and W n have Z k-magic labelings with magic-value 0.

Journal: :Universal Journal of Applied Mathematics 2014

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید