Jason J. Molitierno

From MaRDI portal
(Redirected from Person:233192)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
A tight upper bound on the spectral radius of bottleneck matrices for graphs
Linear Algebra and its Applications
2019-07-12Paper
Entries of the group inverse of the Laplacian matrix for generalized Johnson graphs
Linear and Multilinear Algebra
2018-05-28Paper
An upper bound on the algebraic connectivity of outerplanar graphs
Discrete Mathematics
2017-05-22Paper
Applications of combinatorial matrix theory to Laplacian matrices of graphs2012-01-30Paper
The spectral radius of submatrices of Laplacian matrices for graphs with cut vertices
Linear Algebra and its Applications
2008-03-26Paper
On the algebraic connectivity of graphs as a function of genus
Linear Algebra and its Applications
2007-02-14Paper
On graphs whose Laplacian matrices have distinct integer eigenvalues
Journal of Graph Theory
2005-11-07Paper
The spectral radius of submatrices of Laplacian matrices for trees and its comparison to the Fiedler vector
Linear Algebra and its Applications
2005-09-28Paper
On operations in which graphs are appended to trees
Linear and Multilinear Algebra
2004-05-27Paper
On trees with perfect matchings
Linear Algebra and its Applications
2003-03-11Paper
On graphs with equal algebraic and vertex connectivity
Linear Algebra and its Applications
2002-08-28Paper
The sharpness of a lower bound on the algebraic connectivity for maximal graphs
Linear and Multilinear Algebra
2002-04-09Paper
The algebraic connectivity of two trees connected by an edge of infinite weight
ELA. The Electronic Journal of Linear Algebra
2001-02-19Paper
The algebraic connectivity of two trees connected by an edge of infinite weight
ELA. The Electronic Journal of Linear Algebra
2001-02-19Paper
The algebraic connectivity of two trees connected by an edge of infinite weight
ELA. The Electronic Journal of Linear Algebra
2001-02-19Paper
Tight bounds on the algebraic connectivity of a balanced binary tree
The Electronic Journal of Linear Algebra
2000-04-09Paper
Tight bounds on the algebraic connectivity of a balanced binary tree
The Electronic Journal of Linear Algebra
2000-04-09Paper
Tight bounds on the algebraic connectivity of a balanced binary tree
The Electronic Journal of Linear Algebra
2000-04-09Paper


Research outcomes over time


This page was built for person: Jason J. Molitierno