On the bondage, strong and weak bondage numbers in Complementary Prism Graphs

Aytac Aysun; Turaci Tufan

Conţinutul numărului revistei

Articolul precedent

Articolul urmator

439

Ultima descărcare din IBN:
2022-11-18 23:34

Căutarea după subiecte
similare conform CZU

510+519.17 (1)

Considerații fundamentale și generale ale matematicii (37)

Analiză combinatorică. Teoria grafurilor (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

On the bondage, strong and weak bondage numbers in Complementary Prism Graphs

CZU: 510+519.17

MSC 2010: 05C40, 05C69.

Pag. 59-75

Aytac Aysun¹, Turaci Tufan²

¹ Ege University Izmir,
² Pamukkale University

Disponibil în IBN: 24 aprilie 2021

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

Cerif XML Export

<?xml version='1.0' encoding='utf-8'?>
<CERIF xmlns='urn:xmlns:org:eurocris:cerif-1.5-1' xsi:schemaLocation='urn:xmlns:org:eurocris:cerif-1.5-1 http://www.eurocris.org/Uploads/Web%20pages/CERIF-1.5/CERIF_1.5_1.xsd' xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' release='1.5' date='2012-10-07' sourceDatabase='Output Profile'>
<cfResPubl>
<cfResPublId>ibn-ResPubl-128299</cfResPublId>
<cfResPublDate>2021-03-01</cfResPublDate>
<cfVol>85</cfVol>
<cfIssue>1</cfIssue>
<cfStartPage>59</cfStartPage>
<cfISSN>1561-4042</cfISSN>
<cfURI>https://ibn.idsi.md/ro/vizualizare_articol/128299</cfURI>
<cfTitle cfLangCode='EN' cfTrans='o'>On the bondage, strong and weak bondage numbers in Complementary Prism Graphs</cfTitle>
<cfKeyw cfLangCode='EN' cfTrans='o'>connectivity; Domination number; Strong and
weak domination numbers; Bondage number; Strong and weak
bondage numbers; Complementary prism graphs</cfKeyw>
<cfAbstr cfLangCode='EN' cfTrans='o'><p>Let G = (V (G),E(G)) be a simple undirected graph of order n, and let S &sube; V (G). If every vertex in V (G) &minus; 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 &sube; E(G). The bondage number b(G) of G is the minimum cardinality taken over all sets of F such that (G&minus;F) &gt; (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.</p></cfAbstr>
<cfResPubl_Class>
<cfClassId>eda2d9e9-34c5-11e1-b86c-0800200c9a66</cfClassId>
<cfClassSchemeId>759af938-34ae-11e1-b86c-0800200c9a66</cfClassSchemeId>
<cfStartDate>2021-03-01T24:00:00</cfStartDate>
</cfResPubl_Class>
<cfResPubl_Class>
<cfClassId>e601872f-4b7e-4d88-929f-7df027b226c9</cfClassId>
<cfClassSchemeId>40e90e2f-446d-460a-98e5-5dce57550c48</cfClassSchemeId>
<cfStartDate>2021-03-01T24:00:00</cfStartDate>
</cfResPubl_Class>
<cfPers_ResPubl>
<cfPersId>ibn-person-88273</cfPersId>
<cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId>
<cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId>
<cfStartDate>2021-03-01T24:00:00</cfStartDate>
</cfPers_ResPubl>
<cfPers_ResPubl>
<cfPersId>ibn-person-60306</cfPersId>
<cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId>
<cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId>
<cfStartDate>2021-03-01T24:00:00</cfStartDate>
</cfPers_ResPubl>
</cfResPubl>
<cfPers>
<cfPersId>ibn-Pers-88273</cfPersId>
<cfPersName_Pers>
<cfPersNameId>ibn-PersName-88273-3</cfPersNameId>
<cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId>
<cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId>
<cfStartDate>2021-03-01T24:00:00</cfStartDate>
<cfFamilyNames>Aytac</cfFamilyNames>
<cfFirstNames>Aysun</cfFirstNames>
</cfPersName_Pers>
</cfPers>
<cfPers>
<cfPersId>ibn-Pers-60306</cfPersId>
<cfPersName_Pers>
<cfPersNameId>ibn-PersName-60306-3</cfPersNameId>
<cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId>
<cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId>
<cfStartDate>2021-03-01T24:00:00</cfStartDate>
<cfFamilyNames>Turaci</cfFamilyNames>
<cfFirstNames>Tufan</cfFirstNames>
</cfPersName_Pers>
</cfPers>
</CERIF>