Autor: Baskar, P. - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: LMI based stability criterion for uncertain neutral-type neural networks with discrete and distributed delays
Autorzy:: Baskar, P.
Padmanabhan, S.
Syed Ali, M.
Powiązania:: https://bibliotekanauki.pl/articles/2049954.pdf
Data publikacji:: 2020
Wydawca:: Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:: stability analysis
neutral networks
Lyapunov method
Linear Matrix Inequality
Opis:: This paper studies the problem of robust stability analysis for uncertain neutral-type neural networks with discrete and distributed delays. By constructing an appropriate Lyapunov- Krasovskii functional, new delay-dependent criteria are obtained. We utilized the free-weighting matrices approach and bounding lemmas to estimate the derivative of the Lyapunov-Krasovskii functional. The stability criterion are established in terms of linear matrix inequalities (LMIs). Finally, a numerical example is presented to illustrate the effectiveness of the proposed method.
Źródło:: Control and Cybernetics; 2020, 49, 1; 77-97
0324-8569
Pojawia się w:: Control and Cybernetics
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

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ł

Skocz do pozycji: 3.

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ł

Skocz do pozycji: 4.

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ł

Informacja