The independent domination numbers of strong product of two cycles

DOI10.1080/09720529.2017.1316988zbMath1481.05120OpenAlexW2906369924WikidataQ128713016 ScholiaQ128713016MaRDI QIDQ5031932

Hong Yang, Xiujun Zhang

Publication date: 16 February 2022

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2017.1316988

zbMATH Keywords

cyclecombinatorial problemsstrong productgraph dominationindependent domination

Mathematics Subject Classification ID

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

Related Items (14)

On some leap indices of Polycyclic Aromatic Hydrocarbons (PAHs) ⋮ Cycle super magic labeling of pumpkin, octagonal and hexagonal graphs ⋮ Vertex Szeged index of crystal cubic carbon structure ⋮ Irregularity of Sierpinski graph ⋮ On the M-polynomials and degree-based topological indices of an important class of graphs ⋮ Reverse degree based indices of some nanotubes ⋮ On new reversed topological invariants of nanotubes ⋮ Some reversed degree-based topological indices for graphene ⋮ Distance and eccentricity based invariants of windmill graph ⋮ Construction of Halin graph with perfect k-ary tree and its independent domination number ⋮ On independent domination parameters of some special families of Halin graph ⋮ Power domination number of sunlet graph and other graphs ⋮ Amendable automaton for the language of finite strings of rectangular hilbert curve ⋮ The outer-connected vertex edge domination number in Cartesian product graphs

Uses Software

• NISPOC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Domination versus independent domination in cubic graphs
• On rainbow domination numbers of graphs
• The domination numbers of cylindrical grid graphs
• The independent domination number of a cubic 3-connected graph can be much larger than its domination number
• On the domination number of Cartesian product of two directed cycles
• Independent domination in regular graphs
• Upper bounds for independent domination in regular graphs
• Independent dominating sets and hamiltonian cycles
• Independent Domination in Triangle Graphs
• Towards a theory of domination in graphs

This page was built for publication: The independent domination numbers of strong product of two cycles