On reconstructing of infinite forests
On self-complementary cyclic packing of forests.
On Sequences satisfying .
On signed edge domination numbers of trees
The signed edge domination number of a graph is an edge variant of the signed domination number. The closed neighbourhood of an edge in a graph is the set consisting of and of all edges having a common end vertex with . Let be a mapping of the edge set of into the set . If for each , then is called a signed edge dominating function on . The minimum of the values , taken over all signed edge dominating function on , is called the signed edge domination number of and is...
On some hypotheses concerning trees.
On the absolute sum of chromatic polynomial coefficient of graphs.
On the acyclic point-connectivity of the n-cube.
On the average growth of random Fibonacci sequences.
On the bialgebra of functional graphs and differential algebras.
On the birthday problem: Some generalizations and applications.
On the distribution of depths in increasing trees.
On the distribution of the number of vertices in layers of random trees.
On the dominator colorings in trees
In a graph G, a vertex is said to dominate itself and all its neighbors. A dominating set of a graph G is a subset of vertices that dominates every vertex of G. The domination number γ(G) is the minimum cardinality of a dominating set of G. A proper coloring of a graph G is a function from the set of vertices of the graph to a set of colors such that any two adjacent vertices have different colors. A dominator coloring of a graph G is a proper coloring such that every vertex of V dominates all vertices...
On the formal inverse of polynomial endomorphisms
On the Graph for which there is a Tree as the Inverse Interchange Graph of a Local Graph.
On the Horton-Strahler number for combinatorial tries
On the Horton-Strahler Number for Combinatorial Tries
In this paper we investigate the average Horton-Strahler number of all possible tree-structures of binary tries. For that purpose we consider a generalization of extended binary trees where leaves are distinguished in order to represent the location of keys within a corresponding trie. Assuming a uniform distribution for those trees we prove that the expected Horton-Strahler number of a tree with α internal nodes and β leaves that correspond to a key is asymptotically given by provided that α...
On the inverse eigenvalue problems: the case of superstars.
On the Laplacian spread of trees and unicyclic graphs
On the Maximum of a Branching Process Conditioned on the Total Progeny
The maximum M of a critical Bienaymé-Galton-Watson process conditioned on the total progeny N is studied. Imbedding of the process in a random walk is used. A limit theorem for the distribution of M as N → ∞ is proved. The result is trasferred to the non-critical processes. A corollary for the maximal strata of a random rooted labeled tree is obtained.