G. Chartrand, K. Schultz, Department of Mathematics and Statistics, Western Michigan University, Kalamazoo, Michigan 49008-5152; F. Harary, Department of Computer Science, New Mexico State University, Las Cruces, New Mexico 88003; M. Hossain, Compass Design Automation, M/S 410, 1865 Lundi Ave., San Jose, California 95131
Abstract: For a vertex $v$ in a graph $G$, the set $N_2(v)$ consists of those vertices of $G$ whose distance from $v$ is 2. If a graph $G$ contains a set $S$ of vertices such that the sets $N_2(v)$, $v\in S$, form a partition of $V(G)$, then $G$ is called a $2$-step domination graph. We describe $2$-step domination graphs possessing some prescribed property. In addition, all $2$-step domination paths and cycles are determined.
Keywords: $2$-step domination graph
Classification (MSC 1991): 05C38
Full text available as PDF (smallest), as compressed PostScript (.ps.gz) or as raw PostScript (.ps).
Access to the full text of journal articles on this site is restricted to the subscribers of Myris Trade. To activate your access, please contact Myris Trade at myris@myris.cz.
