Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Shailaja Shirkol"'
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 9, Iss 1, Pp 105-111 (2021)
A subset D ⊆ V(G) is called an equitable dominating set of a graph G if every vertex v ∈ V(G) \ D has a neighbor u ∈ D such that |dG(u)-dG(v)| ≤ 1. An equitable dominating set D is a degree equitable restrained double dominating set (DERD-dom
Externí odkaz:
https://doaj.org/article/22eac842e04a4fb8bcc37aa7d0601cd1
Publikováno v:
Journal of Computational Mathematica. 6:372-395
A subset D ⊆ V is a dominating set of a graph G = (V, E) if N[D] = V . In this paper, we explore the applications of certain domination parameters in QSPR-studies.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dd4dc731f225fcdf255a8ef5ce930ca2
https://doi.org/10.26524/cm139
https://doi.org/10.26524/cm139
Publikováno v:
Journal of Advances in Mathematics and Computer Science. 27:1-14
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::89dba5b29f2fa0af373c6fc064358c78
https://doi.org/10.9734/jamcs/2018/39203
https://doi.org/10.9734/jamcs/2018/39203
Autor:
Kumbargoudra, P., Shailaja Shirkol
Publikováno v:
Scopus-Elsevier
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::22c2fab8ead9ae24a38e0e08ecdd65fb
http://www.scopus.com/inward/record.url?eid=2-s2.0-85075937064&partnerID=MN8TOARS
http://www.scopus.com/inward/record.url?eid=2-s2.0-85075937064&partnerID=MN8TOARS
