A Note of Independent Number and Domination Number of Qn,k,m-Graph
From MaRDI portal
Publication:5088082
DOI10.1142/S0129626419500117zbMath1492.05118MaRDI QIDQ5088082
Zhendong Gu, Shuming Zhou, Jiafei Liu, Qianru Zhou, Yi-Hong Wang
Publication date: 4 July 2022
Published in: Parallel Processing Letters (Search for Journal in Brave)
domination numberindependent number\((n, k)\)-star graph\((n, k)\)-arrangement graph\(Q_{n, k, m}\)-star graph
Cites Work
- Unnamed Item
- Conditional diagnosability of arrangement graphs under the PMC model
- Independent dominating sets in triangle-free graphs
- A comment on ``The domination number of exchanged hypercubes
- A characterization of trees with equal independent domination and secure domination numbers
- New dominating sets in social networks
- On domination number and distance in graphs
- The \(k\)-tuple domination number revisited
- Arrangement graphs: A class of generalized star graphs
- On total domination in the Cartesian product of graphs
- Total domination versus domination in cubic graphs
- Neighbor connectivity of two kinds of Cayley graphs
- An ILP based memetic algorithm for finding minimum positive influence dominating sets in social networks
- Constructing the minimum dominating sets of generalized de Bruijn digraphs
- On the problem of determining which \((n, k)\)-star graphs are Cayley graphs
- Independent domination in hypercubes
- On the \([1,2\)-domination number of generalized Petersen graphs]
- The domination number of exchanged hypercubes
- On the arrangement graph.
- 1-Perfect Codes Over Dual-Cubes vis-à-vis Hamming Codes Over Hypercubes
- Efficient Self-Stabilizing Algorithm for Independent Strong Dominating Sets in Arbitrary Graphs
- On distance ‐dominating and ‐independent sets in sparse graphs
- THE Qn,k,m GRAPH: A COMMON GENERALIZATION OF VARIOUS POPULAR INTERCONNECTION NETWORKS
This page was built for publication: A Note of Independent Number and Domination Number of Qn,k,m-Graph
