The zero forcing number of a graph is the minimum cardinality among all the zero forcing sets of a graph $G$.  The aim of this article is to compute the zero forcing number of complementary Prism graphs.  Some bounds on the zero forcing number of complementary Prism graphs are presented. The remainder of this article discusses the following result.  Let $G$ and $\overline{G }$ be connected graphs. Then $Z(G\overline{G})\leq n-1$ if and only if  there exists two vertices $v_i,v_j \in V(G)$ and $i\neq j$ such that, either $N(v_i) \subseteq N(v_j)$ or $N[v_i] \subseteq N[v_j]$ in $G$.

Operation of a Prism optical fiber sensor for liquid level detection is described. This sensor operates on light intensity modulation, where modulations result from alteration of total internal reflection into partial reflection at the interface. The modulated intensity has been measured by using a source light, a pair of plastic optical fibers (one transmitting and the second one acting as receiving fiber) and a glass Prism providing the total and partial reflections. The performance of this sensor is tested with a laser source and the results are reported here. To analyze the operation of such a sensor theoretical formulation for the sensor operation is also given in this study. A comparison is made between the theoretical estimation and the experimental results.

‎The Laplacian eigenvalues and polynomials of the networks play an essential role in understanding the relations between the topology and the dynamic of networks‎. ‎Generally‎, ‎computation of the Laplacian spectrum of a network is a hard problem and there are just a few classes of graphs with the property that their spectra have been completely computed‎. ‎Laplacian spectrum for $ n$-Prism networks was investigated in [Liu et al.‎, ‎Neurocomputing 198 (2016) 69-73]‎. ‎In this paper‎, ‎we give a method for calculating the eigenvalues and characteristic polynomial of the Laplacian matrix of a generalized $n$-Prism network‎. ‎We show how such large networks can be constructed from small graphs by using graph products‎. ‎Moreover‎, ‎our results are used to obtain the Kirchhoff index and the number of the spanning trees in the generalized $n$-Prism networks‎. ‎We also give some examples of applications‎, ‎that explain the usefulness and efficiency of the proposed method‎.