Zobrazeno 1 - 10
of 23
pro vyhledávání: '"N. Zagaglia Salvi"'
Publikováno v:
Aequationes mathematicae. 92:671-682
The partition graph of a positive integer n, \(P_n\), is the graph whose vertices are the cyclic compositions of n and two vertices are adjacent if one composition is obtained from the other one by replacing two cyclically consecutive parts by their
Autor:
A. Kramer, N. Zagaglia Salvi
Publikováno v:
European Journal of Combinatorics. 31(2):589-597
In this paper we investigate an isomorphism σ between a directed de Bruijn digraph B(2,n) and its converse, which is the digraph obtained from B(2,n) by reversing the direction of all its arcs. A cycle C is said to be σ-self-converse when the cycle
Two sequences (a1, a2, . . . , an) and (b1, b2, . . . , bn), sharing n − 1 elements, are said disarranged if for every subset Q ⊆ [n], the sets {ai | i ∈ Q} and {bi | i ∈ Q} are different. In this paper we investigate properties of these pair
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::60507a589021ce76a42008d8f3ae4570
http://hdl.handle.net/11311/1011979
http://hdl.handle.net/11311/1011979
Autor:
Francesco Regonati, N. Zagaglia Salvi
Publikováno v:
Czechoslovak Mathematical Journal. 44:315-323
Autor:
N. Zagaglia Salvi
Publikováno v:
Discrete Mathematics. 155:267-269
A finite family of pairwise intersecting r-sets is a maximal r-clique if it cannot be extended to another r-clique by adding a new r-set. It is intersection critical if it is not possible to replace any edge by some of its proper subsets, without vio
Autor:
N. Zagaglia Salvi
Publikováno v:
Journal of Graph Theory. 17:589-591
Let λ(G) be the line-distinguishing chromatic number and x′(G) the chromatic index of a graph G. We prove the relation λ(G) ≥ x′(G), conjectured by Harary and Plantholt. © 1993 John Wiley & Sons, Inc.
Publikováno v:
Linear Algebra and its Applications. :153-162
A characterization of a class of symmetric (0, 1) matrices A such that AP is a symmetric matrix too, where P is a permutation matrix, is given, and an application to double coverings of graphs is considered.
Publikováno v:
Linear Algebra and its Applications. (1):367-375
In this paper we investigate generalized circulant permutation matrices of composite order. We give a complete characterization of the order and the structure of symmetric generalized k -circulant permutation matrices in terms of circulant and retroc
Publikováno v:
Discrete Mathematics. (22):3241-3245
Let Bn be the binary de Bruijn digraph of order n and W the quotient set of the set of vertices of Bn with respect to the equivalence relation of rotation. Let G be the graph which has W as the set of vertices and in which two elements C and H are ad
Autor:
N. Zagaglia Salvi
Summary In this paper we determine some properties concerning a (v, k, λ)-difference set when v is even. In particular it is proved in certain cases the non-existence of circulant Hadamard matrices.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0989211f55e005bc2ad3699556365a8c
https://doi.org/10.1016/s0167-5060(08)70271-1
https://doi.org/10.1016/s0167-5060(08)70271-1