Total dominations in P₆-free graphs

DOI10.4134/CKMS.2013.28.4.857MaRDI QIDQ2868499zbMATH OpenOpenAlexFDO

Authors Xuegang Chen, Moo Young Sohn

Publication date 17 December 2013

Published in Communications of the Korean Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4134/ckms.2013.28.4.857

zbMATH Keywords

total domination numbers\(P_6\)-free graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Total domination in 2-connected graphs and in graphs with no induced 6-cycles
• On the domination number of graphs with minimum degree six
• A new upper bound on the total domination number in graphs with minimum degree six
• On the total domination number of graphs
• Total domination in claw-free graphs with minimum degree 2

Cited in

(8)

• Deploying robots with two sensors in \(K_{1,6}\)-free graphs
• Irredundance perfect andP6-free graphs
• Independence and Efficient Domination on P ₆ -free Graphs
• On the chromatic number of (\(P_6\), diamond)-free graphs
• Characterization of \(P_{6}\)-free graphs
• A new characterization of \(P_{6}\)-free graphs
• A new upper bound on the total domination number in graphs with minimum degree six
• New Polynomial Case for Efficient Domination in P 6-free Graphs

This page was built for publication: Total dominations in \(P_6\)-free graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2868499)