A note on domination parameters of the conjunction of two special graphs | Zendy

Maciej Zwierzchowski | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A note on domination parameters of the conjunction of two special graphs

Author(s) -

Maciej Zwierzchowski

Publication year - 2001

Publication title -

discussiones mathematicae graph theory

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.476

H-Index - 19

eISSN - 2083-5892

pISSN - 1234-3099

DOI - 10.7151/dmgt.1152

Subject(s) - mathematics , dominating set , combinatorics , domination analysis , cardinality (data modeling) , set (abstract data type) , induced subgraph , conjunction (astronomy) , discrete mathematics , graph , vertex (graph theory) , computer science , physics , astronomy , programming language , data mining

A dominating set D of G is called a split dominating set of G if the subgraph induced by the subset V (G) i D is disconnected. The cardinality of a minimum split dominating set is called the minimum split domination number of G: Such subset and such number was introduced in [4]. In [2], [3] the authors estimated the domination number of products of graphs. More precisely, they were study products of paths. Inspired by those results we give another estimation of the domination number of the conjunction (the cross product) Pn ^G: The split domination number of Pn ^G also is determined. To estimate this number we use the minimum connected domination number ∞c(G):

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research