Conţinutul numărului revistei |
Articolul precedent |
Articolul urmator |
441 5 |
Ultima descărcare din IBN: 2022-11-18 23:34 |
Căutarea după subiecte similare conform CZU |
510+519.17 (1) |
Fundamental and general considerations of mathematics (37) |
Combinatorial analysis. Graph theory (115) |
SM ISO690:2012 AYTAC, Aysun, TURACI, Tufan. On the bondage, strong and weak bondage numbers in Complementary Prism Graphs. In: Computer Science Journal of Moldova, 2021, nr. 1(85), pp. 59-75. ISSN 1561-4042. |
EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
Computer Science Journal of Moldova | ||||||
Numărul 1(85) / 2021 / ISSN 1561-4042 /ISSNe 2587-4330 | ||||||
|
||||||
CZU: 510+519.17 | ||||||
MSC 2010: 05C40, 05C69. | ||||||
Pag. 59-75 | ||||||
|
||||||
Descarcă PDF | ||||||
Rezumat | ||||||
Let G = (V (G),E(G)) be a simple undirected graph of order n, and let S ⊆ V (G). If every vertex in V (G) − S is adjacent to at least one vertex in S, then the set S is called a dominating set. The domination number of G is the minimum cardinality taken over all sets of S, and it is denoted by (G). Recently, the effect of one or more edges deletion on the domination number has been examined in many papers. Let F ⊆ E(G). The bondage number b(G) of G is the minimum cardinality taken over all sets of F such that (G−F) > (G). In the literature, a lot of domination and bondage parameters have been defined depending on different properties. In this paper, we investigate the bondage, strong and weak bondage numbers of complementary prism graphs of some well-known graph families. |
||||||
Cuvinte-cheie connectivity, Domination number, Strong and weak domination numbers, Bondage number, Strong and weak bondage numbers, Complementary prism graphs |
||||||
|