A note of independent number and domination number of Q_n, k, m-graph

DOI10.1142/S0129626419500117MaRDI QIDQ5088082zbMATH OpenFDO

Authors Jiafei Liu, Shuming Zhou, Zhendong Gu, Qianru Zhou, Yi-Hong Wang

Publication date 4 July 2022

Published in Parallel Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0129626419500117

zbMATH Keywords

\((n, k)\)-arrangement graph\((n, k)\)-star graph\(Q_{n, k, m}\)-star graphdomination numberindependent number

Mathematics Subject Classification ID

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

Recommendations

• A note on idependent domination in graphs
• scientific article; zbMATH DE number 734465
• On independent and \((d, n)\)-domination numbers of hypercubes
• Domination versus independent domination in graphs of small regularity
• scientific article; zbMATH DE number 2544

Cites work

• 1-Perfect Codes Over Dual-Cubes vis-à-vis Hamming Codes Over Hypercubes
• A characterization of trees with equal independent domination and secure domination numbers
• A comment on ``The domination number of exchanged hypercubes
• An ILP based memetic algorithm for finding minimum positive influence dominating sets in social networks
• Arrangement graphs: A class of generalized star graphs
• Conditional diagnosability of arrangement graphs under the PMC model
• Constructing the minimum dominating sets of generalized de Bruijn digraphs
• Efficient self-stabilizing algorithm for independent strong dominating sets in arbitrary graphs
• scientific article; zbMATH DE number 5237247 (Why is no real title available?)
• Independent dominating sets in triangle-free graphs
• Independent domination in hypercubes
• Neighbor connectivity of two kinds of Cayley graphs
• New dominating sets in social networks
• On distance \(r\)-dominating and \(2r\)-independent sets in sparse graphs
• On domination number and distance in graphs
• On the \([1,2]\)-domination number of generalized Petersen graphs
• On the arrangement graph.
• On the problem of determining which \((n, k)\)-star graphs are Cayley graphs
• On total domination in the Cartesian product of graphs
• The k-tuple domination number revisited
• The \(Q_{n,k,m}\) graph: a common generalization of various popular interconnection networks
• The domination number of exchanged hypercubes
• Total domination versus domination in cubic graphs

Cited in

(2)

• Maximum independent sets partition of \((n, k)\)-star graphs
• Algorithms to determine an independent dominating set of \(\mathrm{ESC}(n,k)\)

This page was built for publication: A note of independent number and domination number of \(Q_{n, k, m}\)-graph

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