Exploració per tema "Completely regular code"
Ara es mostren els items 1-3 de 3
-
A general method to obtain the spectrum and local spectra of a graph from its regular partitions
(2020-07-12)
Article
Accés obertIt is well known that, in general, part of the spectrum of a graph can be obtained from the adjacency matrix of its quotient graph given by a regular partition. In this paper, a method that gives all the spectrum, and also ... -
Combinatorial vs. algebraic characterizations of pseudo-distance-regularity around a set
(2009-06)
Report de recerca
Accés obertGiven a simple connected graph $\Gamma$ and a subset of its vertices $C$, the pseudo-distance-regularity around $C$ generalizes, for not necessarily regular graphs, the notion of completely regular code. Up to now, most ... -
On the local spectra of the subconstituents of a vertex set and completely pseudo-regular codes
(2014-10-30)
Article
Accés restringit per política de l'editorialIn this paper we study the relation between the local spectrum of a vertex set C and the local spectra of its subconstituents. In particular, it is shown that, when C is a completely regular code, such spectra are uniquely ...