Results 111 to 120 of about 272 (159)
Computing The Combinatorial Canonical Form Of A Layered Mixed Matrix
. This paper presents an improved algorithm for computing the Combinatorial Canonical Form (CCF) of a layered mixed matrix A = ` Q T ' , which consists of a numerical matrix Q and a generic matrix T .
Kazuo Murota, Mark Scharbrodt
core
Chained structure of directed graphs with applications to social and transportation networks. [PDF]
Concas A +4 more
europepmc +1 more source
An Odd Characterization of the Generalized Odd Graphs
2010 Mathematics Subject Classification: 05E30, 05C50;distance-regular graphs;generalized odd graphs;odd-girth;spectra of graphs;spectral excess theorem;spectral ...
Dam, E.R. van, Haemers, W.H.
core
AMS Subject Classification: 05B05, 05E30, 05C50.Strongly regular graph;Group divisible design;Deza graph;(v;k ...
Kharaghani, H. +2 more
core
Partitioning Rectangular And Structurally Nonsymmetric Sparse Matrices For Parallel Processing
. A common operation in scientific computing is the multiplication of a sparse, rectangular or structurally nonsymmetric matrix and a vector. In many applications the matrix-transposevector product is also required.
Tamara +2 more
core
Disturbance Decoupling By Measurement Feedback for Structured Transfer Matrix Systems
Structured transfer matrix systems are linear systems given by transfer matrices of which the infinite pole order of each nonzero entry is known, while the associated infinite gains are unknown and assumed mutually independent.
J.W. van der Woude
core
Relations between ordinary energy and energy of a self-loop graph. [PDF]
Rakshith BR +3 more
europepmc +1 more source
Sombor characteristic values of cographs. [PDF]
Raza Z, Rather BA, Imran M.
europepmc +1 more source
Some bounds on the distance-sum-connectivity matrix. [PDF]
Gök GK.
europepmc +1 more source

