Disjunctive total domination in permutation graphs

DOI10.1142/S1793830917500094zbMath1358.05224OpenAlexW2556113253MaRDI QIDQ2966509

Eunjeong Yi

Publication date: 7 March 2017

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830917500094

zbMATH Keywords

cyclepathdisjunctive total dominating setgeneralized prismpermutation graphcomplete \(k\)-partite graphdisjunctive total domination number

Mathematics Subject Classification ID

Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Graphs with diameter 2 and large total domination number

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Disjunctive total domination in graphs
• Domination of generalized Cartesian products
• A survey of selected recent results on total domination in graphs
• Domination with exponential decay
• Relations between packing and covering numbers of a tree
• The disjunctive domination number of a graph
• Total domination in graphs
• Towards a theory of domination in graphs
• Domination in functigraphs
• On dominating the Cartesian product of a graph and K₂
• On the domination number of prisms of graphs
• On restricted connectivities of permutation graphs

This page was built for publication: Disjunctive total domination in permutation graphs