On minimum cutsets in independent domination vertex-critical graphs

On minimum cutsets in independent domination vertex-critical graphs

© 2018, University of Queensland. All rights reserved. Let ? i (G) denote the independent domination number of G. A graph G is said to be k-? i -vertex-critical if ? i (G) = k and for each x ? V (G), ? i (G - x) < k. In this paper, we show that for any k-? i -vertex-critical graph H of orde...

Full description

Bibliographic Details
Main Authors: Ananchuen, N., Ruangthampisan, S., Ananchuen, W., Caccetta, Louis
Format: Journal Article
Published: Centre for Discrete Mathematics & Computing 2018
Online Access:http://hdl.handle.net/20.500.11937/68903

Similar Items

Similar Items