Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "labeling" wg kryterium: Temat

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 18
Tytuł:
Labeling of 2-regular graphs by even edge magic
Autorzy:
Gunasekaran, D.
Senbagam, K.
Saranya, R.
Powiązania:
https://bibliotekanauki.pl/articles/1065240.pdf
Data publikacji:
2019
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
Labeling
Magic Labeling
edge magic total labeling
even edge magic total labeling
Opis:
In this paper we introduced the new notion of an even edge magic total labeling of some -regular graphs. An edge magic total labeling of a graph is said to be an even edge magic total labeling if with the condition that for each edg , where is said to be magic constant. We determined cycles of odd length, disjoint union of cycles of length for and are odd, disjoint union , disjoint union , disjoint union and disjoint union are even edge magic total labeling.
Źródło:
World Scientific News; 2019, 135; 32-47
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Extra Skolem Difference Mean Labeling of Some Graphs
Autorzy:
Sundari, G. Muppidathi
Murugan, K.
Powiązania:
https://bibliotekanauki.pl/articles/1030829.pdf
Data publikacji:
2020
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
F-tree
Skolem difference mean labeling
Y-tree
extra skolem difference mean labeling
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 the set {1,2…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…q}. A graph that admits skolem difference mean labeling is called a skolem difference mean graph. If one of the skolem difference mean labeling of G satisfies the condition that all the labels of the vertices are odd, then we call this skolem difference mean labeling an extra skolem difference mean labeling and call the graph G an extra skolem difference mean graph. In this paper, extra skolem difference mean labeling of some graphs are studied.
Źródło:
World Scientific News; 2020, 145; 210-221
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Oblong sum labeling of some special graphs
Autorzy:
Prema, M.
Murugan, K.
Powiązania:
https://bibliotekanauki.pl/articles/1177840.pdf
Data publikacji:
2018
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
Star
oblong numbers
oblong sum labeling
Opis:
Numbers of the form n(n+1) are called oblong numbers. Let O_n be the n^th oblong number. An oblong sum labeling of a graph G =(V,E) with p vertices and q edges is a one to one function f : V(G)→{0,2,4,6,8,…} that induces a bijection f^*: E(G)→{O_1,O_2,O_3,…,O_q } of the edges of G defined by f^* (uv)=f(u)+f(v) for all e = uv ∈ E(G). The graph that admits oblong sum labeling is called oblong sum graph. In this paper, oblong sum labeling of some special graphs is studied.
Źródło:
World Scientific News; 2018, 98; 12-22
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Radio Number of Cycles and their Total Graphs
Autorzy:
Merlin, E. T.
Mangam, Tabitha Agnes
Powiązania:
https://bibliotekanauki.pl/articles/1177700.pdf
Data publikacji:
2018
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
Radio labeling
Radio number
Total graph
Opis:
A radio labeling f of G is an assignment of positive integers to the vertices of G satisfying, │f (u) – f (v)│≥ diam(G) + 1 - d (u ,v) ∀ u, v ∈ V (G) where d (u ,v) is the distance between any two vertices in the graph. The radio number denoted by rn (G) is the minimum span of a radio labeling for G. In this paper, an alternate proof for radio number of cycles and exact radio number for their total graphs has been discussed.
Źródło:
World Scientific News; 2018, 101; 55-64
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Pentagonal Graceful Labeling of Some Graphs
Autorzy:
Mahendran, S.
Murugan, K.
Powiązania:
https://bibliotekanauki.pl/articles/1193373.pdf
Data publikacji:
2021
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
Pentagonal graceful number
pentagonal graceful graphs
pentagonal graceful labeling
Opis:
Numbers of the form (n(3n-1))/2 for all n ≥ 1 are called pentagonal numbers. Let G be a graph with p vertices and q edges. Let f : V(G)→{0,1,2,…,P_q} where P_q is the q^th pentagonal number be an injective function. Define the function f *: E(G) → {1,5,…,P_q} such that f *(uv)=│f(u)-f(v)│for all edges uv∈E(G). If f *( E(G)) is a sequence of distinct consecutive pentagonal numbers {P_1,P_2,…,P_q}, then the function f is said to be pentagonal graceful labeling and the graph which admits such a labeling is called a pentagonal graceful graph. In this paper, pentagonal graceful labeling of some graphs is studied.
Źródło:
World Scientific News; 2021, 155; 98-112
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Some Results on Octagonal Graceful Graphs
Autorzy:
Kovusalya, K.
Namasivayam, P.
Powiązania:
https://bibliotekanauki.pl/articles/1193388.pdf
Data publikacji:
2021
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
Octagonal graceful number
octagonal graceful graphs
octagonal graceful labeling
Opis:
Numbers of the form On = n (3n-2) for all n≥1 are called octagonal numbers. Let G be a graph with p vertices and q edges. Let f: V (G) → {0, 1, 2… Om} where Om is the mth octagonal number be an injective function. Define the function f*:E(G) → {1,8,21,..,Om} such that f*(uv) = |f(u)-f(v)| for all edges uvϵE(G). If f*(E (G)) is a sequence of distinct consecutive octagonal numbers {O1, O2 , …, Oq }, then the function f is said to be octagonal graceful labeling and the graph which admits such a labeling is called a octagonal graceful graph. In this paper, octagonal graceful labeling of some graphs is studied.
Źródło:
World Scientific News; 2021, 156; 1-12
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Octagonal Graceful Labeling of Some Special Graphs
Autorzy:
Mahendran, S.
Powiązania:
https://bibliotekanauki.pl/articles/1193401.pdf
Data publikacji:
2021
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
Octagonal graceful number
octagonal graceful graphs
octagonal graceful labeling
Opis:
Numbers of the form 3n2-2n for all n ≥ 1 are called octagonal numbers. Let G be a graph with p vertices and q edges. Let f :V(G)→{0,1,2,…,M_q} where M_q is the q^th octagonal number be an injective function. Define the function f *: E(G) → {1,8,…,M_q} such that f *(uv) = │f(u)-f(v)│for all edges uv ∈E(G). If f *(E(G)) is a sequence of distinct consecutive octagonal numbers {M_1,M_2,…,M_q}, then the function f is said to be octagonal graceful labeling and the graph which admits such a labeling is called a octagonal graceful graph. In this paper, octagonal graceful labeling of some graphs is studied.
Źródło:
World Scientific News; 2021, 156; 87-101
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Two Modulo Three Sum Graphs
Autorzy:
Esakki, M. Vanu
Nisaya, M. P. Syed Ali
Powiązania:
https://bibliotekanauki.pl/articles/1030957.pdf
Data publikacji:
2020
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
Two modulo three sum graph
Two modulo three sum labeling
Opis:
Let G = (V, E) be a graph with p vertices and q edges is said to be a two modulo three sum graph if there is an injective function f from V(G) to { a∶0≤a≤3q-1 and either a≡0(mod 3) or a≡2(mod 3)} where q is the number of edges of G and such that finduces a bijectionf^* from E(G) to {a∶2≤a≤3q-1 and a≡2(mod 3)} given byf^* (uv)=f(u)+f(v)and the function f is called two modulo three sum labeling of G. In this paper, we introduce an analog of sum labeling known as two modulo three sum labeling and we define two modulo three sum labeling of some tree related graphs. Also we prove that split star, mirror path graph, complete bipartite graph and C_4 ʘ〖nK〗_1 are two modulo three sum graphs.
Źródło:
World Scientific News; 2020, 145; 274-285
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Some results on centered triangular graceful graphs
Autorzy:
Baskar, M.
Namasivayam, P.
Syed Ali Nisaya, M. P.
Mahendran, S.
Powiązania:
https://bibliotekanauki.pl/articles/1193414.pdf
Data publikacji:
2021
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
Centered triangular numbers
centered triangular graceful graphs
centered triangular graceful labeling
Opis:
Let G be a graph with p vertices and q edges. The nth centered triangular number is denoted by C_n, where C_n = 1/2 (3n2 - 3n + 2). A centered triangular graceful labeling of a graph G is a one-to-one function f : V (G) → {0,1,…C_q} that induces a bijection f *: E(G) →{C_1 〖,C〗_2,…C_q} of the edges of G defined by f * (e) = │f(u) - f(v)│, for all e = uv ∊ E(G). The graph which admits such labeling is called a centered triangular graceful graph.
Źródło:
World Scientific News; 2021, 156; 176-191
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Oblong Sum Labeling of Union of Some Graphs
Autorzy:
Muthumanickavel, G.
Murugan, K.
Powiązania:
https://bibliotekanauki.pl/articles/1030786.pdf
Data publikacji:
2020
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
Oblong numbers
Oblong sum labeling
subdivision of graphs
union of graphs
Opis:
An oblong sum labeling of a graph G = (V,E) with p vertices and q edges is a one to one function f:V(G) → {0,2,4,6,...} that induces a bijection f* : E(G) → {O_1,O_2,O_3,..., O_q} of the edges of G defined by f*(uv) = f(u) + f(v) for all e = uv ∈ E(G). The graph that admits oblong sum labeling is called oblong sum graph. In this article, the oblong sum labeling of union of some graphs are studied.
Źródło:
World Scientific News; 2020, 145; 85-94
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Some results on centered triangular sum graphs
Autorzy:
Baskar, M.
Namasivayam, P.
Syed Ali Nisaya, M. P.
Powiązania:
https://bibliotekanauki.pl/articles/1193374.pdf
Data publikacji:
2021
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
Centered triangular numbers
centered triangular sum graphs
centered triangular sum labeling
Opis:
A centered triangular sum labeling of a graph G is a one-to-one function f : V (G) → N ∪{0} that induces a bijection f *: E(G) →{B_1 〖,B〗_2,…B_q} of the edges of G defined by f * (uv) = f(u) + f(v), for all e = uv ∊ E(G). The graph which admits such labeling is called a centered triangular sum graph.
Źródło:
World Scientific News; 2021, 155; 113-128
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Further results on centered triangular sum graphs
Autorzy:
Baskar, M.
Namasivayam, P.
Syed Ali Nisaya, M. P.
Powiązania:
https://bibliotekanauki.pl/articles/1193390.pdf
Data publikacji:
2021
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
Centered triangular numbers
centered triangular sum graphs
centered triangular sum labeling
Opis:
Let G be a graph with p vertices and q edges. The nth centered triangular number is denoted by M_n, where M_n = 1/2 (3n2 - 3n + 2). A centered triangular sum labeling of a graph G is a one-to-one function : V (G) → N ∪{0} that induces a bijection f *: E(G) →{M_1 〖,M〗_2,…M_q} of the edges of G defined by f * (uv) = f(u) + f(v), for all e = uv ∊ E(G). The graph which admits such labeling is called a centered triangular sum graph. In this article, the centered triangular sum labeling of union of some graphs are studied.
Źródło:
World Scientific News; 2021, 156; 13-25
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Some Special Results for Square Pyramidal Graceful Graphs
Autorzy:
Mahendran, S.
Powiązania:
https://bibliotekanauki.pl/articles/1193411.pdf
Data publikacji:
2021
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
Square pyramidal graceful number
square pyramidal graceful graphs
square pyramidal graceful labeling
Opis:
Numbers of the form (n(n+1)(2n+1))/6 for all n≥1 are called square pyramidal numbers. Let G be a graph with p vertices and q edges. Let τ : V(G) →{0, 1, 2… M_k} where M_k is the k^th square pyramidal number be an injective function. Define the function τ*:E(G)→{1,5,14,.., M_k} such that τ *(uv) = |τ (u)- τ (v)| for all edges uvϵE(G). If τ *(E(G)) is a sequence of distinct consecutive square pyramidal numbers {M_1,M_2, …, M_k}, then the function τ is said to be square pyramidal graceful labeling and the graph which admits such a labeling is called a square pyramidal graceful graph. In this paper, some special results for square pyramidal graceful graphs is studied.
Źródło:
World Scientific News; 2021, 156; 147-160
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Even Vertex Tetrahedral Mean Graphs
Autorzy:
Banu, A. Fathima
Chelliah, S.
Syed Ali Nisaya, M. P.
Powiązania:
https://bibliotekanauki.pl/articles/1193397.pdf
Data publikacji:
2021
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
Tetrahedral number
even vertex tetrahedral mean graph
even vertex tetrahedral mean labeling
Opis:
The nth tetrahedral number is denoted by T_n and is of the form T_n = 1/6 n (n+1) (n+2). A graph G with p vertices and q edges is said to have an even vertex tetrahedral mean labeling if there exists an injective function f: V(G) →{0┤, 2, 4, . . . , 2T_q-2 , ├ 2T_q } such that the induced edge function f^*: E(G) →{T_1,T_(2 , . . .) ,T_q } defined by f^*(uv) = (f(u)+ f(v))/2 ∀ e=uv∈E(G) is a bijection. A graph which admits even vertex tetrahedral mean labeling is called an even vertex tetrahedral mean graph. In this paper, we introduce even vertex tetrahedral mean labeling and we prove that path, star, bistar, coconut tree, caterpillar, shrub, P_(m )@ P_n, banana tree, Y- tree and F-tree are even vertex tetrahedral mean graphs.
Źródło:
World Scientific News; 2021, 156; 26-39
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Some Special Graceful Labeling Results of Pentagonal Pyramidal Graceful Graphs
Autorzy:
Mahendran, S.
Powiązania:
https://bibliotekanauki.pl/articles/1193441.pdf
Data publikacji:
2021
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
Pentagonal pyramidal graceful number
pentagonal pyramidal graceful graphs
pentagonal pyramidal graceful labeling
Opis:
Numbers of the form (n^(2 ) (n+1))/2 for all n≥1 are called pentagonal pyramidal numbers. Let G be a graph with p vertices and q edges. Let Ψ : V(G) →{0, 1, 2… M_r} where M_r is the r^th pentagonal pyramidal number be an injective function. Define the function Ψ*:E(G) →{1,6,18,.., M_r} such that Ψ *(uv) = |Ψ (u)- Ψ (v)| for all edges uvϵE(G). If Ψ*(E (G)) is a sequence of distinct consecutive pentagonal pyramidal numbers {M_1,M_2, …, M_r}, then the function Ψ is said to be pentagonal pyramidal graceful labeling and the graph which admits such a labeling is called a pentagonal pyramidal graceful graph. In this paper, some special graceful labeling results of pentagonal pyramidal graceful graphs is studied.
Źródło:
World Scientific News; 2021, 157; 67-79
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 18

Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies