The independent domination numbers of strong product of two cycles

DOI10.1080/09720529.2017.1316988MaRDI QIDQ5031932zbMATH OpenOpenAlexWikidataFDO

Authors 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

combinatorial problemscyclegraph dominationindependent dominationstrong product

Mathematics Subject Classification ID

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

Recommendations

• Domination on strong product of cycles
• On the domination number of the product of two cycles.
• scientific article; zbMATH DE number 7030865
• On domination number of Cartesian product of directed cycles
• The independence number of the strong product of cycles

Cites work

• Domination versus independent domination in cubic graphs
• Handbook of product graphs
• scientific article; zbMATH DE number 3159208 (Why is no real title available?)
• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• scientific article; zbMATH DE number 124521 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• scientific article; zbMATH DE number 881277 (Why is no real title available?)
• Independent dominating sets and hamiltonian cycles
• Independent domination in regular graphs
• Independent Domination in Triangle Graphs
• On rainbow domination numbers of graphs
• On the domination number of Cartesian product of two directed cycles
• 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
• Towards a theory of domination in graphs
• Upper bounds for independent domination in regular graphs

Cited in

(17)

• 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
• The substantial independence number for the strong product of two graphs
• Domination on strong product of cycles
• Smallest independent dominating sets in Kronecker products of cycles

Describes a project that uses

Uses Software

• NISPOC

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

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