Connected domination critical graphs with a block having maximum number of cut vertices

Journal article

Authors/Editors

PAWATON KAEMAWICHANURAT

Strategic Research Themes

Digital Transformation (Strategic Research Themes)

Publication Details

Author list: Henning M.A., Kaemawichanurat P.

Publisher: Elsevier

Publication year: 2021

Volume number: 406

ISSN: 0096-3003

eISSN: 1873-5649

URL: https://www.scopus.com/inward/record.uri?eid=2-s2.0-85105698840&doi=10.1016%2fj.amc.2021.126248&partnerID=40&md5=7caaaf1764d1e5aed23ec0e09258fc6e

Languages: English-Great Britain (EN-GB)

View in Web of Science | View on publisher site | View citing articles in Web of Science

Abstract

A set D of vertices in a graph G is a dominating set if every vertex in V(G)−D is adjacent to a vertex in D. If the subgraph induced by the set D is connected, then D is a connected dominating set in G. The connected domination number of G, γc(G), is the minimum cardinality of a connected dominating set of G. A graph G is k-γc-critical if γc(G)=k and γc(G+uv)

Keywords

Connected domination