Ayse Dilek Maden

Learn More
As a continues study of the paper [4], in here, we first state and prove the p-Cockcroft property (or, equivalently, efficiency) for a presentation, say PE , of the semi-direct product of a free abelian monoid rank two by a finite cyclic monoid. Then, in a separate section, we present sufficient conditions on a special case for PE to be minimal whilst it is(More)
Let G be a connected simple graph whose Laplacian eigenvalues are 0 = μn (G) μn−1 (G) · · · μ1 (G) . In this paper, we establish some upper and lower bounds for the algebraic connectivity and the largest Laplacian eigenvalue of G . Mathematics subject classification (2010): 05C50, 15A18.