Exploració per tema "05C Teoria de grafs"
Ara es mostren els items 2-8 de 8
-
Eigenvalue interlacing and weight parameters of graphs
(Elsevier, 1999-03)
Article
Accés obertEigenvalue interlacing is a versatile technique for deriving results in algebraic combinatorics. In particular, it has been successfully used for proving a number of results about the relation between the (adjacency ... -
From clutters to matroids
(2014-01-31)
Article
Accés obert -
Introduction to graph spectra.
(2011-06-07)
Audiovisual
Accés obert -
Linearly dependent vectorial decomposition of clutters
(2014)
Text en actes de congrés
Accés obertThis paper deals with the question of completing a monotone increas- ing family of subsets G of a finite set ¿ to obtain the linearly dependent subsets of a family of vectors of a vector space. Specifically, we demonstrate ... -
More interlacing for the adjacency matrix
(2011-06-09)
Audiovisual
Accés obert -
Perfect matchings
(2011-06-14)
Audiovisual
Accés obert -
Regularity: spectral characterizations
(2011-06-16)
Audiovisual
Accés obert