Block graphs with large paired domination multisubdivision number | Zendy

Christina M. Mynhardt | Zendy; Joanna Raczek | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Block graphs with large paired domination multisubdivision number

Author(s) -

Christina M. Mynhardt,

Joanna Raczek

Publication year - 2019

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

Subject(s) - combinatorics , domination analysis , mathematics , block (permutation group theory) , graph , enhanced data rates for gsm evolution , discrete mathematics , computer science , artificial intelligence , vertex (graph theory)

The paired domination multisubdivision number of a nonempty graph G, denoted by msdpr(G), is the smallest positive integer k such that there exists an edge which must be subdivided k times to increase the paired domination number of G. It is known that msdpr(G) ≤ 4 for all graphs G. We characterize block graphs with msdpr(G) = 4.

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