Acyclic, star and oriented colourings of graph subdivisions.
Adaptive identification in Torii in the King lattice.
Adaptive tracking via pinning in networks of nonidentical nodes
We investigate the control of dynamical networks for the case of nodes, that although different, can be make passive by feedback. The so-called V-stability characterization allows for a simple set of stabilization conditions even in the case of nonidentical nodes. This is due to the fact that under V-stability characterization the dynamical difference between node of a network reduces to their different passivity degrees, that is, a measure of the required feedback gain necessary to make the node...
Addendum and erratum to the paper "On the size of a maximal induced tree in a random graph"
Addendum to : “Prime graph components of finite almost simple groups” [Rend. Sem. Mat. Univ. Padova 102 (1999), 1–22]
Addendum to “Ring elements as sums of units”
We give a comment to Theorem 1.1 published in our paper “Ring elements as sums of units” [Cent. Eur. J. Math., 2009, 7(3), 395–399].
Adding to the argument of a Hall-Littlewood polynomial.
Adding layers to bumped-body polyforms with minimum perimeter preserves minimum perimeter.
Additive decomposition of matrices under rank conditions and zero pattern constraints
This paper deals with additive decompositions of a given matrix , where the ranks of the summands are prescribed and meet certain zero pattern requirements. The latter are formulated in terms of directed bipartite graphs.
Additive functions on trees
The motivation for considering positive additive functions on trees was a characterization of extended Dynkin graphs (see I. Reiten [R]) and applications of additive functions in representation theory (see H. Lenzing and I. Reiten [LR] and T. Hübner [H]). We consider graphs equipped with integer-valued functions, i.e. valued graphs (see also [DR]). Methods are given for constructing additive functions on valued trees (in particular on Euclidean graphs) and for characterizing...
Additive rank-one nonincreasing maps on Hermitian matrices over the field .
Adjacency matrix equations and related problems: Research notes
Adjacent vertex distinguishing edge colorings of the direct product of a regular graph by a path or a cycle
In this paper we investigate the minimum number of colors required for a proper edge coloring of a finite, undirected, regular graph G in which no two adjacent vertices are incident to edges colored with the same set of colors. In particular, we study this parameter in relation to the direct product of G by a path or a cycle.
Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six
An adjacent vertex distinguishing edge-coloring of a graph G is a proper edge-coloring o G such that any pair of adjacent vertices are incident to distinct sets of colors. The minimum number of colors required for an adjacent vertex distinguishing edge-coloring of G is denoted by χ'ₐ(G). We prove that χ'ₐ(G) is at most the maximum degree plus 2 if G is a planar graph without isolated edges whose girth is at least 6. This gives new evidence to a conjecture proposed in [Z. Zhang, L. Liu, and J. Wang,...
Adjoints and Duals of Matroids Linearly Representable over a Skewfield.
Admissible functions and asymptotics for labelled structures by number of components.
Adomatic and idomatic numbers of graphs
Advanced determinant calculus.
Affine Hjelmslev-Ebenen mit verfeinerten Nachbarschaftsrelationen.
Affine permutations and inversion multigraphs.