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 FCC's proposed net neutrality policy change in 2014 was met with widespread public controversy and outrage. The FCC recently released to the public millions of comments that it received about the issue. It is abundantly clear that the vast majority of citizens prefer to have net neutrality intact, but what exactly are the people saying? What are their… (More)
A comprehensive class of complex-valued harmonic univalent functions with varying arguments defined by Ruscheweyh derivatives is introduced. Necessary and sufficient coefficient bounds are given for functions in this class to be starlike. Distortion bounds and extreme points are also obtained.