Independent domination, colorings and the fractional idomatic number of a graph

Wayne Goddard and Michael A. Henning

Applied Mathematics and Computation, 2020, vol. 382, issue C

Abstract: A set S of vertices is an independent dominating set if it is both independent and dominating, and the idomatic number is the maximum number of vertex-disjoint independent dominating sets. In this paper we consider a fractional version of this. Namely, we define the fractional idomatic number as the maximum ratio |F|/m(F) over all families F of independent dominating sets, where m(F) denotes the maximum number of times an element appears in F. We start with some bounds including a connection with dynamic colorings. Then we show that the independent domination number of a planar graph with minimum degree 2 is at most half its order, and its fractional idomatic number is at least 2. Moreover, we show that an outerplanar graph of minimum degree 2 has idomatic number at least 2. We conclude by providing formulas for the parameters for the join, disjoint union and lexicographic product of graphs, while providing some bounds for cubic graphs.

Keywords: Graph; Domination; Independence; Domatic number (search for similar items in EconPapers)
Date: 2020
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300320303064
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:382:y:2020:i:c:s0096300320303064

DOI: 10.1016/j.amc.2020.125340

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().