An upper bound of the reachability index for a special class of positive 2-D systems.

Bailo, Esteban; Gelonch, Josep; Romero-Vivo, Sergio

Displaying similar documents to “An upper bound of the reachability index for a special class of positive 2-D systems.”

The maximal spectral radius of a digraph with ${(m + 1)}^{2} - s$ edges.

Snellman, Jan (2003)

ELA. The Electronic Journal of Linear Algebra [electronic only]

Similarity:

On the minimum rank of not necessarily symmetric matrices: a preliminary study.

Barioli, Francesco, Fallat, Shaun M., Hall, H.Tracy, Hershkowitz, Daniel, Hogben, Leslie, Van Der Holst, Hein, Shader, Bryan (2009)

ELA. The Electronic Journal of Linear Algebra [electronic only]

Similarity:

A note on linear discrepancy.

Dahl, Geir (2003)

ELA. The Electronic Journal of Linear Algebra [electronic only]

Similarity:

Matrix inversion and digraphs: the one factor case.

Britz, T., Olesky, D.D., van den Driessche, P. (2004)

ELA. The Electronic Journal of Linear Algebra [electronic only]

Similarity:

A combinatorial approach to the conditioning of a single entry in the stationary distribution for a Markov chain.

Kirkland, S. (2004)

ELA. The Electronic Journal of Linear Algebra [electronic only]

Similarity:

The $Q$ -matrix completion problem.

Dealba, Luz Maria, Hogben, Leslie, Sarma, Bhaba Kumar (2009)

ELA. The Electronic Journal of Linear Algebra [electronic only]

Similarity:

Independent Detour Transversals in 3-Deficient Digraphs

Susan van Aardt, Marietjie Frick, Joy Singleton (2013)

Discussiones Mathematicae Graph Theory

Similarity:

In 1982 Laborde, Payan and Xuong [Independent sets and longest directed paths in digraphs, in: Graphs and other combinatorial topics (Prague, 1982) 173-177 (Teubner-Texte Math., 59 1983)] conjectured that every digraph has an independent detour transversal (IDT), i.e. an independent set which intersects every longest path. Havet [Stable set meeting every longest path, Discrete Math. 289 (2004) 169-173] showed that the conjecture holds for digraphs with independence number two. A digraph...