Smallest independent dominating sets in Kronecker products of cycles

DOI10.1016/S0166-218X(00)00295-XzbMath0991.05083OpenAlexW2126631585MaRDI QIDQ5951974

Pranava K. Jha

Publication date: 28 August 2002

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(00)00295-x

zbMATH Keywords

cycleKronecker productindependent dominating set

Mathematics Subject Classification ID

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

Related Items (8)

Dominating direct products of graphs ⋮ Unnamed Item ⋮ \(L(2,1)\)-labeling of direct product of paths and cycles ⋮ Domination-related parameters in rooted product graphs ⋮ \([r,s,t\)-colorings of graph products] ⋮ Perfect \(r\)-domination in the Kronecker product of two cycles, with an application to diagonal/toroidal mesh ⋮ Unnamed Item ⋮ Optimal \(L(d,1)\)-labelings of certain direct products of cycles and Cartesian products of cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A scheme to construct distance-three codes using Latin squares, with applications to the \(n\)-cube
• Approximating the minimum maximal independence number
• Perfect codes over graphs
• Clustering and domination in perfect graphs
• Domination number of the cross product of paths
• On domination numbers of Cartesian products of paths
• Dominating Cartesian products of cycles
• On the domination number of cross products of graphs
• On a Vizing-like conjecture for direct product graphs
• Associative graph products and their independence, domination and coloring numbers
• Hamiltonian decompositions of products of cycles

This page was built for publication: Smallest independent dominating sets in Kronecker products of cycles