Idempotency of Circuit-induced Exchange Operators.
Identifiability, stability and reconstruction results of point sources by boundary measurements in heteregeneous trees.
We consider the inverse problem of determining point wave sources in heteregeneous trees, extensions of one-dimensional stratified sets. We show that the Neumann boundary observation on a part of the lateral boundary determines uniquely the point sources if the time of observation is large enough. We further establish a conditional stability and give a reconstructing scheme.
Identifying codes of Cartesian product of two cliques of the same size.
Identifying codes with small radius in some infinite regular graphs.
Identifying graph automorphisms using determining sets.
Identifying -trees with few characters.
Immersione di sistemi parziali di m-cicli
Impaccando -tagli e giunti
Implementation of directed acyclic word graph
An effective implementation of a Directed Acyclic Word Graph (DAWG) automaton is shown. A DAWG for a text is a minimal automaton that accepts all substrings of a text , so it represents a complete index of the text. While all usual implementations of DAWG needed about 30 times larger storage space than was the size of the text, here we show an implementation that decreases this requirement down to four times the size of the text. The method uses a compression of DAWG elements, i. e. vertices,...
Impossible Specifications for the Modular Group.
Improved bounds for radio -chromatic number of hypercube .
Improved bounds for the number of forests and acyclic orientations in the square lattice.
Improved expansion of random Cayley graphs.
Improved inclusion-exclusion identities and inequalities based on a particular class of abstract tubes.
Improved Sufficient Conditions for Hamiltonian Properties
In 1980 Bondy [2] proved that a (k+s)-connected graph of order n ≥ 3 is traceable (s = −1) or Hamiltonian (s = 0) or Hamiltonian-connected (s = 1) if the degree sum of every set of k+1 pairwise nonadjacent vertices is at least ((k+1)(n+s−1)+1)/2. It is shown in [1] that one can allow exceptional (k+ 1)-sets violating this condition and still implying the considered Hamiltonian property. In this note we generalize this result for s = −1 and s = 0 and graphs that fulfill a certain connectivity condition....
Improved upper bounds for nearly antipodal chromatic number of paths
For paths Pₙ, G. Chartrand, L. Nebeský and P. Zhang showed that for every positive integer n, where ac’(Pₙ) denotes the nearly antipodal chromatic number of Pₙ. In this paper we show that if n is even positive integer and n ≥ 10, and if n is odd positive integer and n ≥ 13. For all even positive integers n ≥ 10 and all odd positive integers n ≥ 13, these results improve the upper bounds for nearly antipodal chromatic number of Pₙ.
Improved upper bounds for the Laplacian spectral radius of a graph.
Improving some bounds for dominating Cartesian products
The study of domination in Cartesian products has received its main motivation from attempts to settle a conjecture made by V.G. Vizing in 1968. He conjectured that γ(G)γ(H) is a lower bound for the domination number of the Cartesian product of any two graphs G and H. Most of the progress on settling this conjecture has been limited to verifying the conjectured lower bound if one of the graphs has a certain structural property. In addition, a number of authors have established bounds for dominating...
In the Square of Graphs, Hamiltonicity and Pancyclicity, Hamiltonian Connectedness and Panconnectedness Are Equivalent Concepts.
Incidence complexes and r-connectedness