- Tytuł:
- Edge Reduced Skolem Difference Mean Number of Some Graphs
- Autorzy:
- Murugan, K.
- Powiązania:
- https://bibliotekanauki.pl/articles/1192710.pdf
- Data publikacji:
- 2016
- Wydawca:
- Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
- Tematy:
-
Skolem difference mean graph
edge reduced skolem difference mean number
skolem difference mean labeling
some graphs - Opis:
- A graph G =(V,E) with p vertices and q edges is said to have skolem difference mean labeling if it is possible to label the vertices x ϵ V with distinct elements f (x) from {1,2,3,…,p+q} in such a way that the edge e =uv is labeled with |f(u)-f(v)|/2 if |f(u)-f(v)| is even and (|f(u)-f(v)|+1)/2 if |f(u)-f(v)| is odd and the resulting labels of the edges are distinct and are from {1,2,3,…,q}. A graph that admits skolem difference mean labeling is called a skolem difference mean graph. In this paper, the author studied the edge reduced skolem difference mean number of some graphs.
- Źródło:
-
World Scientific News; 2016, 30; 129-142
2392-2192 - Pojawia się w:
- World Scientific News
- Dostawca treści:
- Biblioteka Nauki
Artykuł