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ę "Murugan, K." wg kryterium: Autor

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-9 z 9
    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ł
    Tytuł:
    Induced weak cycle number of path and its derived graphs
    Autorzy:
    Murugan, K.
    Somasudari, K.
    Powiązania:
    https://bibliotekanauki.pl/articles/1065244.pdf
    Data publikacji:
    2019
    Wydawca:
    Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
    Tematy:
    derived graphs
    induced weak cycle partition and induced weak cycle number
    path
    Opis:
    Let G = (V, E) be a simple connected graph. The induced weak cycle partition of G is defined as the partition of V(G) into subsets such that each subset induces a cycle or K2 or K1. The induced weak cycle number of G, denoted by ρ_wc (G), is the minimum cardinality taken over all induced weak cycle partitions. In this paper, the concept of induced weak cycle number is introduced and induced weak cycle number of path and some of its derived graphs are studied.
    Źródło:
    World Scientific News; 2019, 135; 48-58
    2392-2192
    Pojawia się w:
    World Scientific News
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A Comparative Case Study on the Social Networking of the Second Year Under Graduate Mathematics Students of the M.D.T. Hindu College, Tirunelveli, Tamil Nadu, India Using Graph Theoretic Parameters
    Autorzy:
    Petchiammal, S.
    Murugan, K.
    Powiązania:
    https://bibliotekanauki.pl/articles/1193041.pdf
    Data publikacji:
    2016
    Wydawca:
    Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
    Tematy:
    Sociometry
    In-degree
    out-degree
    Domination
    Digraphs
    In-domination
    Out-domination
    Opis:
    In this experimental case study, the social relationship of boys and girls studying second year under graduate Mathematics boys in The M.D.T Hindu College, Tirunelveli is compared using sociometry.
    Źródło:
    World Scientific News; 2016, 58; 1-14
    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ł:
    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ł:
    Generating Skolem Difference Mean Graphs
    Autorzy:
    Mariselvi, S.
    Murugan, K.
    Powiązania:
    https://bibliotekanauki.pl/articles/1075422.pdf
    Data publikacji:
    2019
    Wydawca:
    Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
    Tematy:
    Duplication of graph elements
    Near skolem difference mean graphs
    Skolem difference mean 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,….,p+q} in such a way that the edge e = uv is labeledwith |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 edges get distinct labels from {1,2,…,q}. A graph that admits skolem difference mean labeling is called a Skolem difference mean graph A graph G = (V, E) with p vertices and q edges is said to have Near skolem difference mean labeling if it is possible to label the vertices x V with distinct elements f(x) from {1,2,….,p+q-1,p+q+2} in such a way that each edge e = uv, is labeled as f*(e) = |f(u)-f(v)|/2 if |f(u)-f(v)| is even and f*(e) =(|f(u)-f(v)|+1)/2 if |f(u)-f(v)| is odd. The resulting labels of the edges are distinct and from {1,2,…,q}. A graph that admits a Near skolem difference mean labeling is called a Near Skolem difference mean graph. In this paper, the authors generate skolem difference mean graphs from near skolem difference mean graphs.
    Źródło:
    World Scientific News; 2019, 126; 11-22
    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ł:
    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ł:
    Structural, Optical, and Electrical Studies on Pulse Plated $AgInSe_2$ Films
    Autorzy:
    Murugan, S.
    Murali, K.
    Powiązania:
    https://bibliotekanauki.pl/articles/1205200.pdf
    Data publikacji:
    2014-08
    Wydawca:
    Polska Akademia Nauk. Instytut Fizyki PAN
    Tematy:
    68.55.ag
    73.61.Jc
    88.40.hj
    88.40.jn
    Opis:
    In this work, the pulse electrodeposition technique was employed for the first time to deposit $AgInSe_2$ films. The films were deposited at room temperature from a bath containing Analar grade 10 mM silver sulphate, 50 mM indium sulphate and 5 mM $SeO_2$. The deposition potential was maintained at -0.98 V (SCE). Tin oxide coated glass substrates (5.0 $Ω$/sq) were used for depositing the films. The duty cycle was varied in the range of 6-50%. The X-ray diffraction pattern of the thin films deposited at different duty cycles indicated the peaks corresponding to $AgInSe_2$. The transmission spectra exhibited interference fringes. Resistivity of the films increased from 1.5 $Ω$ cm to 12.4 $Ω$ cm. Mobility increased with duty cycle. Carrier density decreased with duty cycle. The photovoltaic parameters of CdS/$AgInSe_2$ solar cells increased with duty cycle.
    Źródło:
    Acta Physica Polonica A; 2014, 126, 3; 727-731
    0587-4246
    1898-794X
    Pojawia się w:
    Acta Physica Polonica A
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-9 z 9

      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