| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 69 0 |
| Căutarea după subiecte similare conform CZU |
| 519.17 (68) |
| Analiză combinatorică. Teoria grafurilor (115) |
 SM ISO690:2012MOHAMMADI, Elham, NADER JAFARI, Rad. On the trees with maximum Cardinality-Redundance number. In: Computer Science Journal of Moldova, 2024, vol. 32, nr. 1(94), pp. 38-45. ISSN 1561-4042. DOI: https://doi.org/10.56415/csjm.v32.03 |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
  Computer Science Journal of Moldova |
||||||
| Volumul 32, Numărul 1(94) / 2024 / ISSN 1561-4042 /ISSNe 2587-4330 | ||||||
|
||||||
| DOI:https://doi.org/10.56415/csjm.v32.03 | ||||||
| CZU: 519.17 | ||||||
| Pag. 38-45 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
A vertex v is said to be over-dominated by a set S if jN[u] \ Sj 2. The cardinality–redundance of S, CR(S), is the number of vertices of G that are over-dominated by S. The cardinality– redundance of G, CR(G), is the minimum of CR(S) taken over all dominating sets S. A dominating set S with CR(S) = CR(G) is called a CR(G)-set. In this paper, we prove an upper bound for the cardinality–redundance in trees in terms of the order and the number of leaves, and characterize all trees achieving equality for the proposed bound. |
||||||
| Cuvinte-cheie dominating set, Cardinality-Redundance, trees |
||||||
|
|
|
|
