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

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

Journal: :ScieXplore: International Journal of Research in Science 2016

Journal: :International Journal of Engineering & Technology 2018

2016
G. Marimuthu Stalin Kumar Guang-Hui Zhang

ARTICLE INFO An H-magic labeling in a H-decomposable graph G is a bijection f : V (G) ∪ E(G) → {1, 2, ..., p+ q} such that for every copy H in the decomposition, ∑

2003
L. Satpathy S. K. Patra

Infinite nuclear matter mass model and the relativistic mean field theory show strong evidence of new neutron magic numbers 100, 150, 164; proton magic number 78 and new islands of stability around N=100, Z ≃ 62; N=150, Z=78; and N= 164, Z ≃ 90 in the drip-line regions of nuclear chart. It is shown that shell effect stabilizes here the instability due to nuclear force giving rise to a new pheno...

2012
J. Baskar Babujee S. Babitha D. Prathap

An edge magic total labeling of a graph with p vertices and q edges is a bijection from the set of vertices and edges to 1, 2, . . . , p+ q such that for every edge the sums of the label of the edge and the label of its two end vertices are constant. Otherwise if the sum is distinct, it is said to be an edge-antimagic total labeling. A graph is called edgeantimagic if it admits edge-antimagic t...

Journal: :Discrete Mathematics 2016
Marcin Anholcer Sylwia Cichacz-Przenioslo Iztok Peterin

Let G = (V,E) be a graph of order n. A closed distance magic labeling of G is a bijection l : V (G) → {1, . . . , n} for which there exists a positive integer k such that ∑ x∈N [v] l(x) = k for all v ∈ V , where N [v] is the closed neighborhood of v. We consider the closed distance magic graphs in the algebraic context. In particular we analyze the relations between the closed distance magic la...

Journal: :Discrete Mathematics 2023

Let Γ=(V,E) be a graph of order n. A closed distance magic labeling Γ is bijection ℓ:V→{1,2,…,n} for which there exists positive integer r such that ∑x∈N[u]ℓ(x)=r all vertices u∈V, where N[u] the neighborhood u. said to if it admits labeling. In this paper, we classify connected circulants with valency at most 5, is, Cayley graphs Cay(Zn;S) |S|≤5, S=−S, 0∉S and S generates Zn.

2010
T. K. Maryati Tunku Abdul Rahman

A graph G = (V (G), E(G)) admits an H-covering if every edge in E(G) belongs to a subgraph of G isomorphic to H. The graph G is H-magic if there exists a bijection f : V (G)∪E(G)→ {1, 2, 3, . . . , |V (G)∪E(G)|} such that for every subgraph H ′ of G isomorphic to H, ∑ v∈V (H′) f(v) + ∑ e∈E(H′) f(e) is constant. Then G is H-supermagic if f(V (G)) = {1, 2, 3, . . . , |V (G)|}. Let {Gi}i=1 be a fi...

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

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