نتایج جستجو برای: labelling of graphs

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

Journal: :SIAM J. Discrete Math. 2005
Sanming Zhou

For given integers j ≥ k ≥ 1, an L(j, k)-labelling of a graph Γ is an assignment of labels—nonnegative integers—to the vertices of Γ such that adjacent vertices receive labels that differ by at least j, and vertices distance two apart receive labels that differ by at least k. The span of such a labelling is the difference between the largest and the smallest labels used, and the minimum span ov...

2004

A graph is called magic (supermagic) if it admits a labelling of the edges by pairwise different (consecutive) positive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. We characterize magic line graphs of general graphs and describe some class of supermagic line graphs of bipartite graphs.

Journal: :J. Comb. Optim. 2013
Xiangwen Li Vicky H. Mak-Hau Sanming Zhou

A k-L(2, 1)-labelling of a graph G is a mapping f : V (G) → {0, 1, 2, . . . , k} such that |f(u)− f(v)| ≥ 2 if uv ∈ E(G) and f(u) 6= f(v) if u, v are distance two apart. The smallest positive integer k such that G admits a k-L(2, 1)-labelling is called the λ-number of G. In this paper we study this quantity for cubic Cayley graphs (other than the prism graphs) on dihedral groups, which are call...

Journal: :International Journal of Innovative Research in Applied Sciences and Engineering 2017

Journal: :International Journal of Combinatorics 2015

Journal: :Discrete Dynamics in Nature and Society 2021

Journal: :Electronic Notes in Discrete Mathematics 2007
Sanming Zhou

We survey recent results on a few distance labelling problems for hypercubes and Hamming graphs.

2010
Hannah Nola Thompson Hannah Thompson

............................................................................................................................................ 2 ACKNOWLEDGEMENTS ....................................................................................................................... 4 CONTENTS .............................................................................................................

Journal: :journal of algorithms and computation 0
r. ponraj department of mathematics, sri paramakalyani college,alwarkurichi-627412, india rajpal singh research scholar, department of mathematics manonmaniam sundaranar university, tirunelveli-627012, india s. sathish narayanan department of mathematics, sri paramakalyani college,alwarkurichi-627412, india

let g be a (p, q) graph. let f : v (g) → {1, 2, . . . , k} be a map. for each edge uv, assign the label gcd (f(u), f(v)). f is called k-prime cordial labeling of g if |vf (i) − vf (j)| ≤ 1, i, j ∈ {1, 2, . . . , k} and |ef (0) − ef (1)| ≤ 1 where vf (x) denotes the number of vertices labeled with x, ef (1) and ef (0) respectively denote the number of edges labeled with 1 and not labeled with 1....

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

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