Zobrazeno 1 - 10
of 2 289
pro vyhledávání: '"Domination analysis"'
Autor:
Chang Liu, Jianping Li
Publikováno v:
AIMS Mathematics, Vol 7, Iss 2, Pp 2529-2542 (2022)
The zeroth-order general Randić index of graph $ G = (V_G, E_G) $, denoted by $ ^0R_{\alpha}(G) $, is the sum of items $ (d_{v})^{\alpha} $ over all vertices $ v\in V_G $, where $ \alpha $ is a pertinently chosen real number. In this paper, we obtai
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cf3aa4d670c8dbfeed578104b3763247
https://doi.org/10.3934/math.2022142
https://doi.org/10.3934/math.2022142
Publikováno v:
Discrete Applied Mathematics. 305:205-210
In this note, we consider the following problem: given a connected graph G , can we reduce the domination number of G by using only one edge contraction? We show that the problem is polynomial-time solvable on ( P 3 + k P 2 ) -free graphs for any k
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2818138fd7979359fac24161682446e2
https://doi.org/10.1016/j.dam.2021.09.009
https://doi.org/10.1016/j.dam.2021.09.009
Autor:
Fatemeh Ramezani, Saeid Alikhani
Publikováno v:
Iranian Journal of Science and Technology, Transactions A: Science. 46:291-296
Let $$G=(V,E)$$ be a simple graph. A function $$f:V\longrightarrow \{-1,1\}$$ is a signed dominating function if for every vertex $$v \in V$$ , the closed neighborhood of v contains more vertices with function value 1 than with $$-1$$ . The weight of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1a969d46cd0e027212482b6be46ca145
https://doi.org/10.1007/s40995-021-01239-5
https://doi.org/10.1007/s40995-021-01239-5
Publikováno v:
European Journal of Pure and Applied Mathematics. 14:1490-1506
This paper introduces and investigates a variant of partial domination called the connected α-partial domination. For any graph G = (V (G), E(G)) and α ∈ (0, 1], a set S ⊆ V (G) is an α-partial dominating set in G if |N[S]| â‰
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::42d2cc654e7fdaf6dabcdc85aaca6a0a
https://doi.org/10.29020/nybg.ejpam.v14i4.4168
https://doi.org/10.29020/nybg.ejpam.v14i4.4168
Autor:
Helen Moso Rara, Sandra Abo Nanding
Publikováno v:
European Journal of Pure and Applied Mathematics. 14:1226-1236
Let G be a connected graph. A subset S of V (G) is a connected co-independent hop dominating set in G if the subgraph induced by S is connected and V (G)\S is an independent set where for each v ∈ V (G)\S, there exists a vertex u ∈ S such t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4a9f22e9d1f353c95d1b2d9fda5a105a
https://doi.org/10.29020/nybg.ejpam.v14i4.4069
https://doi.org/10.29020/nybg.ejpam.v14i4.4069
Autor:
Helen Moso Rara, Helyn Cosinas Sumaoy
Publikováno v:
European Journal of Pure and Applied Mathematics. 14:1367-1378
A set S ⊆ V (G) is a restrained strong resolving dominating set in G if S is a strongresolving dominating set in G and S = V (G) or ⟨V (G) \ S⟩ has no isolated vertex. The restrained strong resolving domination number of G, denoted by
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b138d182272198806d8bb250a2cbcf60
https://doi.org/10.29020/nybg.ejpam.v14i4.4112
https://doi.org/10.29020/nybg.ejpam.v14i4.4112
Publikováno v:
European Journal of Pure and Applied Mathematics. 14:1324-1336
In this paper, we characterize the k-cost effective domination in the join of graphs.Further, we investigate the k-cost effective domination, cost effective domination index, maximal cost effective domination in the join of graphs.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3435092aac9fb39b2e1ffc5cafda6f11
https://doi.org/10.29020/nybg.ejpam.v14i4.4127
https://doi.org/10.29020/nybg.ejpam.v14i4.4127
Publikováno v:
Ars Mathematica Contemporanea. 20:233-241
Let G be a graph with no isolated vertex and f : V ( G ) → {0, 1, 2} a function. Let V i = { x ∈ V ( G ) : f ( x ) = i } for every i ∈ {0, 1, 2} . We say that f is a total Roman dominating function on G if every vertex in V 0 is adjacent to at
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b4127172590b681e26edb8f3d4717162
https://doi.org/10.26493/1855-3974.2284.aeb
https://doi.org/10.26493/1855-3974.2284.aeb
Autor:
K. L. Bondar, R. A. Muneshwar
Publikováno v:
Journal of Discrete Mathematical Sciences and Cryptography. 25:135-145
In this paper, we introduce a graph topological structure called Inclusion Graph of a Topology . The diameter, girth, connectivity, maximal independent sets, different variants of domination number...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6d51f0f9cd585578ef3053787ceebab2
https://doi.org/10.1080/09720529.2021.1969752
https://doi.org/10.1080/09720529.2021.1969752
Publikováno v:
Mathematics and Statistics. 9:859-866
Let be a finite group. The probability that two selected elements from and from are chosen at random in a way that the greatest common divisor also known as gcd, of the order of and , which is equal to one, is called as the relative coprime probabili
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::981c7ea70822521fdb9f91b4edfa3b52
https://doi.org/10.13189/ms.2021.090601
https://doi.org/10.13189/ms.2021.090601