Factor domination in graphs
Let a factoring of a graph G into pairwise edge-disjoint factors \(G_ 1,...,G_ t\) be given; each of these factors contains all vertices of G. A subset \(D_ f\) of the vertex set of G is called a factor dominating set, if it is a dominating set for all the factors \(G_ 1,...,G_ t\). (A dominating set in a graph is a subset of its vertex set having the property that each vertex of the graph either is contained in it, or is adjacent to a vertex of it.) The factor domination number \(\gamma_ t(G_ 1,...,G_ t)\) is the minimum number of vertices of a factor dominating set. Some theorems on this number of general t are proved. Then the particular case \(t=2\) is studied.
- On global domination critical graphs
- On the global Roman domination number in graphs
- Factor d-domatic colorings of graphs
- Factor domination and minimum degree
- Some new results on global dominating sets
- Simultaneous graph parameters: factor domination and factor total domination
- LD-graphs and global location-domination in bipartite graphs
- Simultaneous resolvability in graph families
- Global 2-point set domination number of a graph
- Global domination
- The simultaneous metric dimension of families composed by lexicographic product graphs
- scientific article; zbMATH DE number 140127 (Why is no real title available?)
- Simultaneous domination in graphs
- Outer independent global dominating set of trees and unicyclic graphs
- Trees with equal total domination and 2-rainbow domination numbers
- Simultaneously dominating all spanning trees of a graph
- scientific article; zbMATH DE number 7276884 (Why is no real title available?)
- Global italian domination in graphs
- Factors with Multiple Degree Constraints in Graphs
- The simultaneous fractional dimension of graph families
- THE GLOBAL EQUITABLE DOMINATION IN GRAPHS
- On roman, global and restrained domination in graphs
- Domination-related parameters in middle graphs
- On the simultaneous metric dimension of a graph and its complement
- Algorithms for the global domination problem
- Simultaneous resolvability in families of corona product graphs
- Bibliography on domination in graphs and some basic definitions of domination parameters
- The simultaneous metric dimension of graph families
This page was built for publication: Factor domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2641315)