The purpose of the paper is to provide an answer to a long standing problem to compute the distance distribution among the nodes in a star graph, i.e., to compute the exact number...
L. Wang, S. Subramanian, Shahram Latifi, Pradip K....
We obtain an upper bound on a new type of exponential sums with linear recurrence sequences. We apply this bound to estimate the Fourier coefficients, and thus the nonlinearity, o...
We give an example of supersonic solutions to a one-dimensional steady state Euler-Poisson system arising in the modeling of plasmas and semiconductors. The existence of the supers...
We show that a combinatorial question which has been studied in connection with lower bounds for the knapsack problem by Brimkov and Dantchev (2001) is related to threshold graphs...
In this note we provide a simple derivation of an explicit formula for the price of an option on a dividend-paying equity when the parameters in the Black
An eigenvalue of a graph G is called a main eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero, and it is well known that a graph has exactly one ma...