Maximum independent sets partition of \((n, k)\)-star graphs

DOI10.1155/2019/8247419zbMath1420.05146arXiv1702.04060OpenAlexW2735666268MaRDI QIDQ2325197

Fu-Tao Hu

Publication date: 9 September 2019

Published in: Complexity (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1702.04060

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Fault-tolerance of \((n, k)\)-star networks
• \((n-3)\)-edge-fault-tolerant weak-pancyclicity of \((n,k)\)-star graphs
• Strong local diagnosability of \((n,k)\)-star graphs and Cayley graphs generated by 2-trees with missing edges
• On the bounds of feedback numbers of \((n,k)\)-star graphs
• The conditional fault diagnosability of \((n, k)\)-star graphs
• Weak-vertex-pancyclicity of (\(n,k\))-star graphs
• One-to-many node-disjoint paths in \((n,k)\)-star graphs
• Distance formula and shortest paths for the \((n,k)\)-star graphs
• On the surface area of the \((n,k)\)-star graph
• The \((n,k)\)-star graph: A generalized star graph
• A kind of conditional fault tolerance of \((n, k)\)-star graphs
• Constructing vertex-disjoint paths in \((n, k)\)-star graphs
• A group-theoretic model for symmetric interconnection networks
• Theory and Application of Graphs
• Fault Hamiltonicity and fault Hamiltonian connectivity of the (n,k)-star graphs
• TOPOLOGICAL PROPERTIES OF THE (n,k)-STAR GRAPH
• THE SPANNING CONNECTIVITY OF THE (n,k)-STAR GRAPHS