Minimal locating-paired-dominating sets in triangular and king grids
Let G = (V,E) be a finite or infinite graph. A set S ? V is paired-dominating if S induces a matching in G and S dominates all vertices of G. A set S ? V is locating if for any two distinct vertices u, v in V \ S, N(u) ? S 6= N(v) ? S, where N(u) and N(v) are open neighborhoods of vertices u and v....
Sábháilte in:
| Príomhchruthaitheoirí: | , , |
|---|---|
| Formáid: | Artigo |
| Teanga: | Inglês |
| Foilsithe / Cruthaithe: |
Elsevier
2018-08-01
|
| Sraith: | Kuwait Journal of Science |
| Ábhair: | |
| Rochtain ar líne: | https://journalskuwait.org/kjs/index.php/KJS/article/view/3897 |
| Clibeanna: |
Níl clibeanna ann, Bí ar an gcéad duine le clib a chur leis an taifead seo!
|