Zobrazeno 1 - 10
of 14
pro vyhledávání: '"Isagani S. Cabahug"'
Autor:
Winelyn P. Pelias, Isagani S. Cabahug
Publikováno v:
Asian Research Journal of Mathematics. 19:41-50
For a nontrivial connected graph G, a non-empty set S \(\subseteq\) V (G) is a bipartite dominating set of graph G, if the subgraph G[S] induced by S is bipartite and for every vertex not in S is dominated by any vertex in S. The bipartite domination
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::af69b6d4502d5d809d5b04cd3da5b722
https://doi.org/10.9734/arjom/2023/v19i5658
https://doi.org/10.9734/arjom/2023/v19i5658
Publikováno v:
Asian Research Journal of Mathematics. 19:1-14
For a nontrivial connected graph G with no isolated vertex, a nonempty subset D \(\subseteq\) V (G) is a rings dominating set if D is a dominating set and for each vertex \(\upsilon\) \(\in\) V \ D is adjacent to at least two vertices in V \ D. Thus,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::84dab54b39328073ce9ee8e6531da93b
https://doi.org/10.9734/arjom/2023/v19i4649
https://doi.org/10.9734/arjom/2023/v19i4649
Publikováno v:
Asian Research Journal of Mathematics. 19:8-17
For a nontrivial connected graph G, a non-empty set S \(\subseteq\) V (G) is a bipartite dominating set of graph G, if the subgraph G[S] induced by S is bipartite and for every vertex not in S is dominated by any vertex in S. The bipartite domination
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c192b14602da0226e51d924b2e5fd362
https://doi.org/10.9734/arjom/2023/v19i3645
https://doi.org/10.9734/arjom/2023/v19i3645
Autor:
Ann Leslie V. Flores, Isagani S. Cabahug Jr., Cherry Mae R. Balingit, Rolito G. Eballe, Remarl Joseph M. Damalerio
Publikováno v:
Asian Research Journal of Mathematics. :128-140
The global clustering coecient is one of the most useful indices in complex network analysis. It is another metric that somehow measures how close a graph from being a complete graph. In this paper we present some expressions for the global clusterin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e914c909bbb8fcf3165110731ae5a6d3
https://doi.org/10.9734/arjom/2022/v18i12632
https://doi.org/10.9734/arjom/2022/v18i12632
Publikováno v:
Asian Research Journal of Mathematics. :27-33
For a nontrivial connected graph \(G\) with no isolated vertex, a nonempty subset \(D \subseteq V(G)\) is a rings dominating set if each vertex \(v \in V-D\) is adjacent to at least two vertices in \(V-D\). Thus, the dominating set \(D\) of \(V(G)\)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::deb8737c21cd8832a53276f2adc52eac
https://doi.org/10.9734/arjom/2022/v18i12622
https://doi.org/10.9734/arjom/2022/v18i12622
Publikováno v:
Asian Research Journal of Mathematics. :16-26
A set S of a graph G = (V (G);E(G)) is a rings dominating set if S is a dominating set and for every vertex in the complement of S has atleast two adjacent vertices. The caridinality of the minimum rings dominating set is the rings domination number
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::536809fc482c3461c51a7c0f18b1feee
https://doi.org/10.9734/arjom/2022/v18i12621
https://doi.org/10.9734/arjom/2022/v18i12621
Publikováno v:
Asian Research Journal of Mathematics. :25-34
set S of vertices in a graph G = (V (G);E(G)) is a hinge dominating set if every vertex \(u\) \(\in\) V \(\setminus \) \(S\) is adjacent to some vertex \(u\) \(\in\) \(S\) and a vertex \(w\) \(\in\) V \(\setminus\) \(S\) such that (\(v\), \(w\)) is n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d56ff4a60ed83f49f0478829859ae497
https://doi.org/10.9734/arjom/2022/v18i930404
https://doi.org/10.9734/arjom/2022/v18i930404
Publikováno v:
Asian Research Journal of Mathematics. :1-7
For a connected simple graph G , a non-empty set \(S \subseteq V(G)\) of vertices is a safe set if, for every component \(A \text { of }\langle S\rangle_{G}\) and every component \(B \text { of }\langle V(G)-S\rangle_{G}\) adjacent to A , it holds th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f89d4e49fd2bd65625dcb4ff4e15aab6
https://doi.org/10.9734/arjom/2022/v18i930399
https://doi.org/10.9734/arjom/2022/v18i930399
Publikováno v:
Asian Research Journal of Mathematics. :22-34
Let G be a nontrivial, undirected, simple graph. Let S be a subset of V (G). S is a restrained cost effective set of G if for each vertex v in S, degS(v) \(\leq\) degV (G)rS(v) and the subgraph induced by the vertex set, V (G) r S has no isolated ver
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9648934ae8f905e8adc24cb1c0378128
https://doi.org/10.9734/arjom/2022/v18i830395
https://doi.org/10.9734/arjom/2022/v18i830395
Autor:
Rolito G. Eballe, Isagani S. Cabahug
Publikováno v:
International Journal of Contemporary Mathematical Sciences. 16:127-134
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::548a229cb92550302f323129f930c60c
https://doi.org/10.12988/ijcms.2021.91609
https://doi.org/10.12988/ijcms.2021.91609