Hassine Achour

Independent Domination under Iterated Line Graphs: The Regular Case

Version 1.0.0. For a graph parameter P and a prolific graph G, Caro, Lauri and Zarb defined the index ind(P,G) as the first iterated line graph on which P exceeds its value on G. This preprint determines the independent-domination index on the class of connected regular graphs of...

Independent Domination and Minimum Maximal Matchings in Clique-Fiber Cartesian Products

Version 1.0.0. This preprint studies the independent domination number i(G) and the minimum cardinality s(G) of a maximal matching in Cartesian products with complete-graph fibers. For every nonempty finite simple graph H of order h and every m ≥ 2, it proves the universal bound...

Independent Domination under Iterated Line Graphs: The Regular Case

Version 1.0.0. For a graph parameter P and a prolific graph G, Caro, Lauri and Zarb defined the index ind(P,G) as the first iterated line graph on which P exceeds its value on G. This preprint determines the independent-domination index on the class of connected regular graphs of...