Zobrazeno 1 - 10
of 98
pro vyhledávání: '"K. Suriya"'
Publikováno v:
Journal of Mathematics, Vol 2021 (2021)
A set S⊆V of a graph G=V,E is called a co-independent liar’s dominating set of G if (i) for all v∈V, NGv∩S≥2, (ii) for every pair u,v∈V of distinct vertices, NGu∪NGv∩S≥3, and (iii) the induced subgraph of G on V−S has no edge. The
Externí odkaz:
https://doaj.org/article/21f41bbcc5024959babf8e041f60d284
Publikováno v:
In Composites Part B 15 February 2021 207
Publikováno v:
Proceedings of the National Academy of Sciences, India Section A: Physical Sciences. 92:593-597
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2d26b85abef076f1e996251a273b85f4
https://doi.org/10.1007/s40010-022-00778-9
https://doi.org/10.1007/s40010-022-00778-9
Publikováno v:
2023 International Conference on Sustainable Computing and Data Communication Systems (ICSCDS).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d192cc984ef4782287cb6cfcb7215eb8
https://doi.org/10.1109/icscds56580.2023.10104901
https://doi.org/10.1109/icscds56580.2023.10104901
Autor:
W.P.D.N. Rathnayake P, Geeth Dulanjana D, A.V.B.W. Punchihewa G, N.W. Anjana G, P. K. Suriya Kumari, Uthpala Samarakoon
Publikováno v:
2022 4th International Conference on Advancements in Computing (ICAC).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c4ea22364c58d88c2d9b4ddb40966ede
https://doi.org/10.1109/icac57685.2022.10025119
https://doi.org/10.1109/icac57685.2022.10025119
Publikováno v:
Advances in Mathematics: Scientific Journal. 9:9329-9333
The minimum length in a graph G between two vertices is defined to be the distance between the two vertices and is denoted by d$\left(a,b\right)$. The farthest vertex distance from a vertex 'a' is known as the eccentricity e(a) of the vertex 'a'. Enu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0aed8de5c92fa7acebd4d2a701200f8d
https://doi.org/10.37418/amsj.9.11.37
https://doi.org/10.37418/amsj.9.11.37
Publikováno v:
Journal of Discrete Mathematical Sciences and Cryptography. 24:997-1006
A graph G is a divisible dominating graph if the vertices are labeled with positive integers d and n except 0, such that the vertex labeled with n is adjacent to the vertex named with d if and only...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::70cc904caf340d3bb24315d6b61f5c6a
https://doi.org/10.1080/09720529.2020.1744813
https://doi.org/10.1080/09720529.2020.1744813
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:
Journal of Discrete Mathematical Sciences and Cryptography. 22:787-799
A neighborhood outer split dominating set (nosd-set) in a graph G is a dominating set S with the property that the sub graph induced by the open neighborhood of the set S is disconnected. T...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::63138243bf3b9f40a729f656f6cd4dbc
https://doi.org/10.1080/09720529.2019.1681695
https://doi.org/10.1080/09720529.2019.1681695
Publikováno v:
Proceedings of the National Academy of Sciences, India Section A: Physical Sciences; Dec2022, Vol. 92 Issue 4, p593-597, 5p