Some recurrence relations for Cauchy numbers of the first kind.
François Jaeger conjectured in 1974 that every cyclically 4-connected cubic graph is dual hamiltonian, that is to say the vertices of can be partitioned into two subsets such that each subset induces a tree in . We shall make several remarks on this conjecture.
A digraph D is k-transitive if the existence of a directed path (v0, v1, . . . , vk), of length k implies that (v0, vk) ∈ A(D). Clearly, a 2-transitive digraph is a transitive digraph in the usual sense. Transitive digraphs have been characterized as compositions of complete digraphs on an acyclic transitive digraph. Also, strong 3 and 4-transitive digraphs have been characterized. In this work we analyze the structure of strong k-transitive digraphs having a cycle of length at least k. We show...
Let α ∈ (0,1) and let ) be a graph. According to Dunbar, Hoffman, Laskar and Markus [3] a set is called an α-dominating set of G, if for all . We prove a series of upper bounds on the α-domination number of a graph G defined as the minimum cardinality of an α-dominating set of G.