A characterization of connected (1,2)-domination graphs of tournaments

zbMATH Open1238.05194MaRDI QIDQ647233FDOQ647233

Authors: K. A. S. Factor, Larry J. Langley 

Publication date: 1 December 2011

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Recommendations

• An introduction to \((1,2)\)-domination graphs
• scientific article; zbMATH DE number 1416473
• Publication:4489248
• scientific article; zbMATH DE number 2197923
• scientific article; zbMATH DE number 1833085

zbMATH Keywords

tournament\((1,2)\)-dominating pair\((1,2)\)-domination graph

Mathematics Subject Classification ID

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

Cited In (5)

• Kings and heirs: a characterization of the \((2, 2)\)-domination graphs of tournaments
• An introduction to \((1,2)\)-domination graphs
• Tournaments whose indecomposability graph admits a vertex cover of size 2.
• (1, 2)-DOMINATION IN GRAPHS UNDER SOME BINARY OPERATIONS
• (1, 2)-DOUBLE DOMINATION IN GRAPHS

This page was built for publication: A characterization of connected \((1,2)\)-domination graphs of tournaments

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