Bounds on co-independent liar's domination in graphs
Summary: A set \(S\subseteq V\) of a graph \(G=(V,E)\) is called a co-independent liar's dominating set of \(G\) if (i) for all \(v\in V\), \(|N_G [v] \cap S|\geq 2\), (ii) for every pair \(u\), \(v\in V\) of distinct vertices, \(|(N_G [u] \cup N_G [v]) \cap S|\geq 3\), and (iii) the induced subgraph of \(G\) on \(V-S\) has no edge. The minimum cardinality of vertices in such a set is called the co-independent liar's domination number of \(G\), and it is denoted by \(\gamma_{\text{coi}}^{LR} (G)\). In this paper, we introduce the concept of co-independent liar's domination number of the middle graph of some standard graphs such as path and cycle graphs, and we propose some bounds on this new parameter.
- _t-graph of a graph G
- Characterization of total very excellent trees
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- Induced subgraphs of gamma graphs
- Liar's domination in graphs
- Liar's domination in graphs: complexity and algorithm
- Minimizing Kirchhoff index among graphs with a given vertex bipartiteness
- On topological indices for new classes of Benes network
- Various bounds for liar's domination number
This page was built for publication: Bounds on co-independent liar's domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2034485)
