descriptionPublicationkeyboard_double_arrow_right Article 31 May 2016Publisher:Steklov Mathematical InstituteJournal:Sbornik: Mathematics, volume 207, pages 639-651 (issn: 1064-5616, eissn: 1468-4802,

Authors: Al'pin Y.; Al'pina V.;

doi: 10.1070/sm8567

Combinatorial structure ofk-semiprimitive matrix families

- Summary
- Subjects
- Related research
  (3)
- Metrics

Abstract

© 2016 Russian Academy of Sciences (DoM), London Mathematical Society, Turpion Ltd.Protasov's Theorem on the combinatorial structure of k-primitive families of non-negative matrices is generalized to k-semiprimitive matrix families. The main tool is the binary relation of colour compatibility on the vertices of the coloured graph of the matrix family. Bibliography: 14 titles.

Related Organizations

Kazan Federal University
Russian Federation

Keywords

Coloured graphs, 500, Nonnegative matrices, Perron-frobenius theorem, 510

3 Research products, page 1 of 1

Maximal exponents of polyhedral cones (II)
2010IsAmongTopNSimilarDocuments
On 𝐾-primitive rings
1979IsAmongTopNSimilarDocuments
On the Critical Exponent for k-Primitive Sets
2021IsAmongTopNSimilarDocuments

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	1
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average