Affiliation:
1. Department of Mathematics and Statistics , Thompson Rivers University 805 TRU Way Kamloops, B.C. Canada V2C 0C8
2. Department of Mathematics and Statistics , University of Victoria PO BOX 1700 STN CSC Victoria, B.C. Canada
Abstract
Abstract
The independent domination number i(G) of a graph G is the minimum cardinality of a maximal independent set of G, also called an i(G)-set. The i-graph of G, denoted ℐ (G), is the graph whose vertices correspond to the i(G)-sets, and where two i(G)-sets are adjacent if and only if they differ by two adjacent vertices. Not all graphs are i-graph realizable, that is, given a target graph H, there does not necessarily exist a source graph G such that H = ℐ (G). We consider a class of graphs called “theta graphs”: a theta graph is the union of three internally disjoint nontrivial paths with the same two distinct end vertices. We characterize theta graphs that are i-graph realizable, showing that there are only finitely many that are not. We also characterize those line graphs and claw-free graphs that are i-graphs, and show that all 3-connected cubic bipartite planar graphs are i-graphs.
Reference11 articles.
1. L.W. Beineke, Characterizations of derived graphs, J. Combinatorial Theory 9 (1970), 129–135.
2. R.C. Brewster, C.M. Mynhardt, and L.E. Teshima, Reconfiguration of minimum independent dominating sets in graphs, Commun. Comb. Optim. DOI: 10.22049/cco.2023.28965.1797.
3. G. Chartrand, L. Lesniak, and P. Zhang, Graphs and Digraphs, 6th edition, Chapman & Hall, London, 2015.
4. T.W. Haynes, S.T. Hedetniemi, and P.J. Slater, Domination in Graphs, Marcel Dekker, New York, 1998.
5. T.W. Haynes, S.T. Hedetniemi, and P.J. Slater, Fundamentals of Domination in Graphs, Marcel Dekker, New York, 1998.