Show simple item record

dc.contributor.authorAnanchuen, N.
dc.contributor.authorAnanchuen, W.
dc.contributor.authorCaccetta, Louis
dc.identifier.citationAnanchuen, N. and Ananchuen, W. and Caccetta, L. 2017. A characterization of 3-i-critical graphs of connectivity two. Quaestiones Mathematicae. 40 (7): pp. 937-965.

A subset S of V (G) is an independent dominating set of G if S is independent and each vertex of G is either in S or adjacent to some vertex of S. Let i(G) denote the minimum cardinality of an independent dominating set of G. A graph G is k-i-critical if i(G) = k, but i(G + uv) < k for any pair of non-adjacent vertices u and v of G. The problem that arises is that of characterizing k-i critical graphs. In this paper, we characterize connected 3-i-critical graphs with minimum vertex cutset of size 2. More specifically, we show that if G is a connected 3-i-critical graph with minimum vertex cutset S of size 2 and the number of components of G - S is exactly two, then G is isomorphic to a graph in one of nine classes of connected 3-i-critical graphs. The results in this paper together with results in [1] and [2] provide a complete characterization of connected 3-i-critical graphs with a minimum cutset of size at most 3.

dc.titleA characterization of 3-i-critical graphs of connectivity two
dc.typeJournal Article
dcterms.source.titleQuaestiones Mathematicae
curtin.departmentDepartment of Mathematics and Statistics
curtin.accessStatusFulltext not available

Files in this item


There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record