Results 111 to 120 of about 279 (161)
Further results on monotonic graph invariants and bipartiteness number
, 2019 The bipartiteness of a graph is the minimum number of vertices whose deletion from G results in a bipartite graph. If a graph invariant decreases or increases with addition of edges of its complement, then it is called a monotonic graph invariant.
Liu, Jia-Bao, Chen, Hanlin
core
Spectral top-down recovery of latent tree models. [PDF]
Inf inference, 2023 Aizenbud Y +7 more
europepmc +1 more source
Highly parallel sparse matrix-matrix multiplication
, 2010 . Generalized sparse matrix-matrix multiplication (or SpGEMM) is a key primitive for many high performance graph algorithms as well as for some linear solvers, such as algebraic multi-grid.
R. Gilbert, Aydin Buluc, John
core
New constructions of nonregular cospectral graphs
Special MatricesWe consider two types of joins of graphs G1{G}_{1} and G2{G}_{2}, G1⊻G2{G}_{1}\hspace{0.33em}⊻\hspace{0.33em}{G}_{2} – the neighbors splitting join and G1∨=G2{G}_{1}\mathop{\vee }\limits_{=}{G}_{2} – the nonneighbors splitting join, and compute ...
Hamud Suleiman, Berman Abraham
doaj +1 more source
Which graphs are rigid in ℓ p d ? [PDF]
J Glob Optim, 2022 Dewar S, Kitson D, Nixon A.
europepmc +1 more source
Constructions of \(t\)-designs from weighing matrices and association schemes
We provide a method to construct \(t\)-designs from weighing matrices and association schemes. One instance of our method can produce a \(3\)-design from any (symmetric or skew-symmetric) conference matrix, thereby providing a partial answer to a ...
Gary Greaves, Sho Suda
core +1 more source
Chained structure of directed graphs with applications to social and transportation networks. [PDF]
Appl Netw Sci, 2022 Concas A +4 more
europepmc +1 more source
Computing The Combinatorial Canonical Form Of A Layered Mixed Matrix
, 1987 . 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
Disturbance Decoupling By Measurement Feedback for Structured Transfer Matrix Systems
, 1994 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]
HeliyonRakshith BR +3 more
europepmc +1 more source