Results 121 to 130 of about 279 (161)

Partitioning Rectangular And Structurally Nonsymmetric Sparse Matrices For Parallel Processing

, 1998
. 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, Tamara G. Kolda, Bruce Hendrickson   +2 more
core  

Sombor characteristic values of cographs. [PDF]

Heliyon
Raza Z, Rather BA, Imran M.
europepmc   +1 more source

A note on heat kernel of graphs. [PDF]

Heliyon
Yang Y, Ke W, Wang Z, Qiao H.
europepmc   +1 more source

Some bounds on the distance-sum-connectivity matrix. [PDF]

J Inequal Appl, 2018
Gök GK.
europepmc   +1 more source

Improved McClelland and Koolen-Moulton bounds for distance energy of a graph. [PDF]

J Inequal Appl, 2018
Sridhara G, Rajesh Kanna MR, Pradeep Kumar R, Soner Nandappa D.   +3 more
europepmc   +1 more source

Factorization norms and an inverse theorem for MaxCut. [PDF]

Math Ann
Balla I, Hambardzumyan L, Tomon I.
europepmc   +1 more source

On comparison between the distance energies of a connected graph. [PDF]

Heliyon
Ganie HA, Rather BA, Shang Y.
europepmc   +1 more source

Spectral norm and energy of a digraph with respect to a VDB topological index. [PDF]

Heliyon
Espinal C, Monsalve J, Rada J.
europepmc   +1 more source

On the least signless Laplacian eigenvalue of a non-bipartite connected graph with fixed maximum degree. [PDF]

J Inequal Appl, 2017
Guo SG, Zhang R.
europepmc   +1 more source

NUMERICAL INTEGRATION ON GRAPHS: WHERE TO SAMPLE AND HOW TO WEIGH. [PDF]

Math Comput, 2020
Linderman GC, Steinerberger S.
europepmc   +1 more source