Structural properties of connected domination critical graphs

Journal article

Authors/Editors

Strategic Research Themes

Publication Details

Author list: Almalki N., Kaemawichanurat P.

Publisher: MDPI

Publication year: 2021

Volume number: 9

Issue number: 20

ISSN: 22277390

eISSN: 2227-7390

URL: https://www.scopus.com/inward/record.uri?eid=2-s2.0-85118887386&doi=10.3390%2fmath9202568&partnerID=40&md5=a81a7d27105f5a38ac3da175d902e3cb

Languages: English-Great Britain (EN-GB)

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

Abstract

A graph G is said to be k-γc-critical if the connected domination number γc(G) is equal to k and γc(G+uv)

Keywords

Matching, Realizability