Characterizing Cartesian fixers and multipliers

DOI10.7151/DMGT.1594zbMATH Open1255.05163OpenAlexW2081467762MaRDI QIDQ2906375FDOQ2906375

Authors: Stephen Benecke, Christina M. Mynhardt 

Publication date: 5 September 2012

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/80cdb1e9f2629c81755fd053200665ef13864255

Recommendations

• Equality in Vising's conjecture fixing one factor of the cartesian product.
• Total domination of Cartesian products of graphs
• Total domination in the Cartesian product of a graph and \(K_2\) or \(C_n\)
• Paired domination of Cartesian products of graphs
• Couterexample to a conjecture on the structure of bipartite partionable graphs

zbMATH Keywords

domination numberCartesian productCartesian fixerCartesian multiplierconsistent fixerprism doublerprism fixer

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76) Graph theory (05C99)

Cited In (1)

• Equality in Vising's conjecture fixing one factor of the cartesian product.

This page was built for publication: Characterizing Cartesian fixers and multipliers

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