Recently in [1] Goyal and Agarwal interpreted a generalized basic series as a generating function for a colour partition function and a weighted lattice path fu
A coloring of G is d-distance if any two vertices at distance at most d from each other get different colors. The minimum number of colors in d-distance colorin
A graph G is said to have a perfect dominating set S if S is a set of vertices of G and for each vertex v of G, either v is in S and v is adjacent to no other v
The generalized correlativity of input signal and output signal of a stack filtering operator is defined and used for numerously measuring these filtering opera
An orthogonal double cover (ODC) of a graph H is a collection of subgraphs (pages) of H, so that they cover every edge of H twice and the intersection of any tw