نتایج جستجو برای: skolem odd difference mean labeling

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

Journal: :Mapana - Journal of Sciences 2012

Journal: :Journal of Physics: Conference Series 2019

Journal: :Applied Mathematics and Nonlinear Sciences 2017

Journal: :journal of algorithms and computation 0
p. jeyanthi department of mathematics, govindammal aditanar college for women, tiruchendur- 628 215,india

0

Journal: :Shanlax International Journal of Arts, Science and Humanities 2022

2014
R. Vasuki A. Nagarajan S. Arockiaraj

In this paper we introduce a new type of labeling known as even vertex odd mean labeling. A graph G with p vertices and q edges is said to have an even vertex odd mean labeling if there exists an injective function f : V (G) → {0, 2, 4, . . . , 2q−2, 2q} such that the induced map f∗ : E(G) → {1, 3, 5, . . . , 2q− 1} defined by f∗(uv) = f(u)+f(v) 2 is a bijection. A graph that admits an even ver...

Journal: :Australasian J. Combinatorics 2016
Nancy E. Clarke Asiyeh Sanaei

In this paper, we consider Skolem (vertex) labellings and present (hooked) Skolem labellings for generalised Dutch windmills whenever such labellings exist. Specifically, we show that generalised Dutch windmills with more than two cycles cannot be Skolem labelled and that those composed of two cycles of lengths m and n, n ≥ m, cannot be Skolem labelled if and only if n−m ≡ 3, 5 (mod 8) and m is...

Journal: :Shanlax International Journal of Arts, Science and Humanities 2022

2017
M. Kannan R. Vikrama Prasad R. Gopi

A graph with p vertices and q edges is said to have an even vertex odd mean labeling if there exists an injective function f:V(G){0, 2, 4, ... 2q-2,2q} such that the induced map f*: E(G) {1, 3, 5, ... 2q-1} defined by f*(uv)=     f u f v 2  is a bijection. A graph that admits an even vertex odd mean labeling is called an even vertex odd mean graph. In this paper we pay our attention to p...

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

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