Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Pandiaraja, Duraisamy"'
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.
Publikováno v:
Environment, Development and Sustainability.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0744cb2fea3526740cdfdadb47ee4868
https://doi.org/10.1007/s10668-023-03022-5
https://doi.org/10.1007/s10668-023-03022-5
Publikováno v:
Discrete Mathematics, Algorithms and Applications.
A restrained dominating set [Formula: see text] is said to be a strong restrained dominating set of G if every vertex [Formula: see text] is adjacent to a vertex [Formula: see text] and [Formula: see text]. The minimum cardinality of a strong restrai
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ac3318d86ccc06df72d6a9ce23b4aac2
https://doi.org/10.1142/s1793830922501725
https://doi.org/10.1142/s1793830922501725
Autor:
Muralikrishnan, Selvam, Shanmugam, Esakkimuthu, Nagendran, Natarajan Arun, Pandiaraja, Duraisamy
Publikováno v:
Journal of Threatened Taxa; 6/26/2023, Vol. 15 Issue 6, p23297-23306, 10p
Publikováno v:
Discrete Mathematics, Algorithms & Applications; Aug2021, Vol. 13 Issue 4, pN.PAG-N.PAG, 18p
Publikováno v:
Discrete Mathematics, Algorithms and Applications. 13:2050096
Domination is an emerging field in graph theory and many domination parameters were introduced in the meanwhile for different real time situations. Minimum domination number of a graph can be identified by converting the problem into linear programmi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::26f4f465b641c3d7c5c8c2c9a4a0cfe7
https://doi.org/10.1142/s1793830920500962
https://doi.org/10.1142/s1793830920500962