Results 111 to 120 of about 292 (163)

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 analysis of transient amplifiers for death-birth updating constructed from regular graphs. [PDF]

J Math Biol, 2021
Richter H.
europepmc   +1 more source

ON THE SUM OF LAPLACIAN EIGENVALUES OF GRAPHS [PDF]

, 2008
AMS Subject Classification: 05C50 ...
Haemers, W.H.; id_orcid, Mohammadian, A., A. Mohammadian, Tayfeh-Rezaie, B., W. H. Haemers, B. Tayfeh-rezaie   +5 more
core  

Spectral top-down recovery of latent tree models. [PDF]

Inf inference, 2023
Aizenbud Y, Jaffe A, Wang M, Hu A, Amsel N, Nadler B, Chang JT, Kluger Y.   +7 more
europepmc   +1 more source

New constructions of nonregular cospectral graphs

Special Matrices
We 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

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  

Which graphs are rigid in ℓ p d ? [PDF]

J Glob Optim, 2022
Dewar S, Kitson D, Nixon A.
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  

Chained structure of directed graphs with applications to social and transportation networks. [PDF]

Appl Netw Sci, 2022
Concas A, Fenu C, Reichel L, Rodriguez G, Zhang Y.   +4 more
europepmc   +1 more source

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