On \((d,2)\)-dominating numbers of butterfly networks

zbMATH Open0982.05075MaRDI QIDQ2721818

Rujun Shao, Tianxing Yao

Publication date: 11 December 2001

Published in: Journal of Baoji College of Arts and Science. Natural Science (Search for Journal in Brave)

zbMATH Keywords

butterfly networks\((d,2)\)-dominating numbers

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Title not available (Why is that?) ⋮ THE TRAPPING PROBLEM OF WEIGHTED (2,2)-FLOWER NETWORKS WITH THE SAME WEIGHT SEQUENCE

This page was built for publication: On \((d,2)\)-dominating numbers of butterfly networks

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