On the absolute sum of chromatic polynomial coefficient of graphs.
On the acyclic point-connectivity of the n-cube.
On the adjacent eccentric distance sum of graphs
In this paper we show bounds for the adjacent eccentric distance sum of graphs in terms of Wiener index, maximum degree and minimum degree. We extend some earlier results of Hua and Yu [Bounds for the Adjacent Eccentric Distance Sum, International Mathematical Forum. Vol. 7 (2O02) no. 26. 1280-1294]. The adjaceni eccentric distance sum index of the graph G is defined as [...] where ε(υ) is the eccentricity of the vertex υ, deg(υ) is the degree of the vertex υ and D(υ) = ∑u∊v(G) d (u,υ)is the sum...
On the algebraic form of Keller's conjecture
On the area discrepancy of triangulations of squares and trapezoids.
On the asymptotic behavior of some counting functions
The investigation of certain counting functions of elements with given factorization properties in the ring of integers of an algebraic number field gives rise to combinatorial problems in the class group. In this paper a constant arising from the investigation of the number of algebraic integers with factorizations of at most k different lengths is investigated. It is shown that this constant is positive if k is greater than 1 and that it is also positive if k equals 1 and the class group satisfies...
On the asymptotic behavior of some counting functions, II
The investigation of the counting function of the set of integral elements, in an algebraic number field, with factorizations of at most k different lengths gives rise to a combinatorial constant depending only on the class group of the number field and the integer k. In this paper the value of these constants, in case the class group is an elementary p-group, is estimated, and determined under additional conditions. In particular, it is proved that for elementary 2-groups these constants are equivalent...
On the asymptotic number of plane curves and alternating knots.
On the automorphism group of an infinite graph.
On the automorphism group of integral circulant graphs.
On the automorphism group of Solomon's descent algebra.
On the average growth of random Fibonacci sequences.
On the balanced domination of graphs
Let be a graph and let denote the closed neighbourhood of a vertex in . A function is said to be a balanced dominating function (BDF) of if holds for each vertex . The balanced domination number of , denoted by , is defined as A graph is called -balanced if . The novel concept of balanced domination for graphs is introduced. Some upper bounds on the balanced domination number are established, in which one is the best possible bound and the rest are sharp, all the corresponding...
On the basic contrasts in PBIB designs
On the basis number and the minimum cycle bases of the wreath product of some graphs i
A construction of a minimum cycle bases for the wreath product of some classes of graphs is presented. Moreover, the basis numbers for the wreath product of the same classes are determined.
On the basis number of the composition of different ladders with some graphs.
On the basis number of the corona of graphs.
On the basis of the direct product of paths and wheels.
On the behavior of a variant of Hofstadter's -sequence.
On the bialgebra of functional graphs and differential algebras.