the object of this paper is to establish a summability factor theorem for summabilitya, , k  1 k  where a is the lower triangular matrix with non-negative entries satisfying certain conditions.

we obtain sufficient conditions for the series σanλn to be absolutely summable of order k by atriangular matrix.

A strongly connected digraph is called a cactoid-type if each of its blocks consisting finitely many oriented cycles sharing common directed path. In this article, we find...

let $a = (a_{i,j})_{1 leq i,j leq n}$ be an $n times n$ matrixwhere $n geq 2$. let $dt(a)$, its second immanant be the immanant corresponding to the partition $lambda_2 = 2,1^{n-2}$. let $g$ be a connected graph with blocks $b_1, b_2, ldots b_p$ and with$q$-exponential distance matrix $ed_g$. we given an explicitformula for $dt(ed_g)$ which shows that $dt(ed_g)$ is independent of the manner in ...

It is necessary to generate the automorphism group of a chemical graph in computer-aided structure elucidation. An Euclidean graph associated with a molecule is defined by a weighted graph with adjacency matrix M = [dij], where for i≠j, dij is the Euclidean distance between the nuclei i and j. In this matrix dii can be taken as zero if all the nuclei are equivalent. Otherwise, one may introduce...

creating and preserving large patches in land use configuration and satisfying compactness and contiguity in land use configuration are nature-prescribed and nature-inspired criteria that can be used in land use planning better that before. accompanying compactness and contiguity as the important landscape metrics in land use planning and land use configuration is close to applying proactive ap...