Zobrazeno 1 - 10
of 357
pro vyhledávání: '"edge-strength"'
Publikováno v:
IEEE Access, Vol 12, Pp 108425-108444 (2024)
Identifying crucial proteins in protein-protein interaction (PPI) networks is essential for understanding biological systems. However, the ambiguity of interaction strength hinders accurate identification of key proteins. To address this issue, this
Externí odkaz:
https://doaj.org/article/8c8d976bcbde43bfb7e7ae65c562a044
Autor:
Sri Nurhayati, Yeni Susanti
Publikováno v:
Jurnal Matematika Integratif, Vol 19, Iss 1, Pp 89-108 (2023)
Let G be a connected, simple, and undirrected graph, where V (G) is the vertex set and E(G) is the edge set. Let k be a natural numbers. For graph G we define a total k−labeling ρ such that the vertices of graph G are labeled with {0, 2, 4, . . .
Externí odkaz:
https://doaj.org/article/a88bfd697f3940ba8011f05a552a872e
Publikováno v:
Discrete Mathematics Letters, Vol 12, Pp 22-25 (2023)
Externí odkaz:
https://doaj.org/article/3f899ac3f13647e495de189312fda2e3
Autor:
M. Basher
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 20, Iss 1, Pp 35-39 (2023)
AbstractA toroidal fullerene (toroidal polyhex) is a cubic bipartite graph embedded on the torus such that each face is a hexagon. The total k-labeling is defined as a combination of an edge function χe from the edge set to the set [Formula: see tex
Externí odkaz:
https://doaj.org/article/1c7f27448709435aa263dec2a014fe22
Publikováno v:
AIMS Mathematics, Vol 7, Iss 7, Pp 11784-11800 (2022)
For a graph $ G $, we define a total $ k $-labeling $ \varphi $ is a combination of an edge labeling $ \varphi_e(x)\to\{1, 2, \ldots, k_e\} $ and a vertex labeling $ \varphi_v(x) \to \{0, 2, \ldots, 2k_v\} $, such that $ \varphi(x) = \varphi_v(x) $ i
Externí odkaz:
https://doaj.org/article/a0df1e3a4592412b9255d87f840d858b
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Mohamed Basher
Publikováno v:
AIMS Mathematics, Vol 6, Iss 10, Pp 10405-10430 (2021)
Let $ G(V, E) $ be a graph, where $ V(G) $ is the vertex set and $ E(G) $ is the edge set. Let $ k $ be a natural number, a total k-labeling $ \varphi:V(G)\bigcup E(G)\rightarrow \{0, 1, 2, 3, ..., k\} $ is called an edge irregular reflexive $ k $-la
Externí odkaz:
https://doaj.org/article/5729c0501ba64aecb39aab144a564096
Autor:
Mohamed Basher
Publikováno v:
AIMS Mathematics, Vol 6, Iss 9, Pp 9342-9365 (2021)
A labeling of a graph is an assignment that carries some sets of graph elements into numbers (usually the non negative integers). The total k-labeling is an assignment fe from the edge set to the set {1,2,...,ke} and assignment fv from the vertex set
Externí odkaz:
https://doaj.org/article/a1bb5d97f970460092f80a89e79c5957
Autor:
Irfan Setiawan, Diari Indriati
Publikováno v:
Indonesian Journal of Combinatorics, Vol 5, Iss 1, Pp 35-45 (2021)
Let G(V,E) be a simple and connected graph which set of vertices is V and set of edges is E. Irregular reflexive k-labeling f on G(V,E) is assignment that carries the numbers of integer to elements of graph, such that the positive integer {1,2, 3,...
Externí odkaz:
https://doaj.org/article/8255eee0d49e4eecadfeb378f8b713c4
Publikováno v:
Xi'an Gongcheng Daxue xuebao, Vol 35, Iss 1, Pp 75-80 (2021)
In order to reduce the multiplicative speckle noise of synthetic aperture radar(SAR) image, an improved non-local mean (NLM) algorithm is proposed in this paper. Firstly, the coefficient of variation (CV) was used to estimate the SAR image region div
Externí odkaz:
https://doaj.org/article/fd4c3fd5ad704919a93f26bb5b152686