Weakly connected domination subdivision numbers | Zendy

Joanna Raczek | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Weakly connected domination subdivision numbers

Author(s) -

Joanna Raczek

Publication year - 2008

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.1395

Subject(s) - subdivision , mathematics , combinatorics , dominating set , domination analysis , induced subgraph , connectivity , connected component , graph , cardinality (data modeling) , connected dominating set , discrete mathematics , vertex (graph theory) , computer science , geography , archaeology , data mining

A set D of vertices in a graph G = (V, E) is a weakly connected dominating set of G if D is dominating in G and the subgraph weakly induced by D is connected. The weakly connected domination number of G is the minimum cardinality of a weakly connected dominating set of G. The weakly connected domination subdivision number of a connected graph G is the minimum number of edges that must be subdivided (where each egde can be subdivided at most once) in order to increase the weakly connected domination number. We study the weakly connected domination subdivision numbers of some families of graphs.

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