Roger Jia

Learn More
The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. For many interconnection networks, the optimal sets are precisely those induced by a single vertex. Recently, the conditional matching preclusion number of a graph was introduced to look(More)
The matching preclusion number of a graph with an even number of vertices is the minimum number of edges whose deletion results in a graph that has no perfect matchings. For many interconnection networks, the optimal sets are precisely those induced by a single vertex. It is natural to look for obstruction sets beyond those induced by a single vertex. The(More)
— This paper further enhances the previous research into reducing the standby power consumption of a PIR luminaire. Generally, although a PIR luminaire will turn on when motion is detected and turn off when the motion is no longer present, the luminaire still consumes 1 to 3 W of power when the lamp is off and plugged in. In this design the luminaire(More)
  • 1