- Full text PDF available (8)
- This year (2)
- Last 5 years (9)
- Last 10 years (13)
Journals and Conferences
As a continues study of the paper , 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)
In this paper, we present some inequalities for the Co-PI index involving the some topological indices, the number of vertices and edges, and the maximum degree. After that, we give a result for trees. In addition, we give some inequalities for the largest eigenvalue of the Co-PI matrix of G.
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.
In this paper, lower and upper bounds for the clique and independence numbers are established in terms of the eigenvalues of the signless Laplacian matrix of a given graph G.